E-polynomials of the SL(2, C)-character varieties of surface groups

We compute the E-polynomials of the moduli spaces of representations of the fundamental group of a once-punctured surface of any genus into SL(2, C), for any possible holonomy around the puncture. We follow the geometric technique introduced in [12], based on stratifying the space of representations, and on the analysis of the behavior of the E-polynomial under fibrations.

On the existence of exponential polynomials with prefixed gaps

This paper shows that the conjecture of Lapidus and Van Frankenhuysen on the set of dimensions of fractality associated with a nonlattice fractal string is true in the important special case of a generic nonlattice self-similar string, but in general is false. The proof and the counterexample of this have been given by virtue of a result on exponential polynomials P(z), with real frequencies linearly independent over the rationals, that establishes a bound for the number of gaps of RP, the closure of the set of the real projections of its zeros, and the reason for which these gaps are produced.

Privileged Regions in Critical Strips of Non-lattice Dirichlet Polynomials

This paper shows, by means of Kronecker’s theorem, the existence of infinitely many privileged regions called r -rectangles (rectangles with two semicircles of small radius r ) in the critical strip of each function Ln(z):= 1−∑nk=2kz , n≥2 , containing exactly [Tlogn2π]+1 zeros of Ln(z) , where T is the height of the r -rectangle and [⋅] represents the integer part.

Numerical resolution of Emden's equation using Adomian polynomials

Purpose: In this paper the authors aim to show the advantages of using the decomposition method introduced by Adomian to solve Emden's equation, a classical non‐linear equation that appears in the study of the thermal behaviour of a spherical cloud and of the gravitational potential of a polytropic fluid at hydrostatic equilibrium. Design/methodology/approach: In their work, the authors first review Emden's equation and its possible solutions using the Frobenius and power series methods; then, Adomian polynomials are introduced. Afterwards, Emden's equation is solved using Adomian's decomposition method and, finally, they conclude with a comparison of the solution given by Adomian's method with the solution obtained by the other methods, for certain cases where the exact solution is known. Findings: Solving Emden's equation for n in the interval [0, 5] is very interesting for several scientific applications, such as astronomy. However, the exact solution is known only for n=0, n=1 and n=5. The experiments show that Adomian's method achieves an approximate solution which overlaps with the exact solution when n=0, and that coincides with the Taylor expansion of the exact solutions for n=1 and n=5. As a result, the authors obtained quite satisfactory results from their proposal. Originality/value: The main classical methods for obtaining approximate solutions of Emden's equation have serious computational drawbacks. The authors make a new, efficient numerical implementation for solving this equation, constructing iteratively the Adomian polynomials, which leads to a solution of Emden's equation that extends the range of variation of parameter n compared to the solutions given by both the Frobenius and the power series methods.

On the Complex Dimensions of Nonlattice Fractal Strings in Connection with Dirichlet Polynomials

In this paper we give a new characterization of the closure of the set of the real parts of the zeros of a particular class of Dirichlet polynomials that is associated with the set of dimensions of fractality of certain fractal strings. We show, for some representative cases of nonlattice Dirichlet polynomials, that the real parts of their zeros are dense in their associated critical intervals, confirming the conjecture and the numerical experiments made by M. Lapidus and M. van Frankenhuysen in several papers.

On the Result of Invariance of the Closure Set of the Real Projections of the Zeros of an Important Class of Exponential Polynomials

In this paper we provide the proof of a practical point-wise characterization of the set RP defined by the closure set of the real projections of the zeros of an exponential polynomial P(z) = Σn j=1 cjewjz with real frequencies wj linearly independent over the rationals. As a consequence, we give a complete description of the set RP and prove its invariance with respect to the moduli of the c′ js, which allows us to determine exactly the gaps of RP and the extremes of the critical interval of P(z) by solving inequations with positive real numbers. Finally, we analyse the converse of this result of invariance.

Line and area orthogonality of Jacobi polynomials,

"Supported in part by contract U.S. AEC AT(11-1) 1469 and grant NSF-6J-217".

Orthogonality relations for Chebyshev polynomials,

"C00-1469-0154."

Parallel methods and bounds of evaluating polynomials.

Bibliography: p. 24.

The use of Chebyshev matrix polynomials in the iterative solution of linear equations compared to the method of successive overrelaxtion /

"(This is being submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics, June 1959.)"

On decomposition of sub-linearised polynomials

We give a detailed exposition of the theory of decompositions of linearised polynomials, using a well-known connection with skew-polynomial rings with zero derivative. It is known that there is a one-to-one correspondence between decompositions of linearised polynomials and sub-linearised polynomials. This correspondence leads to a formula for the number of indecomposable sub-linearised polynomials of given degree over a finite field. We also show how to extend existing factorisation algorithms over skew-polynomial rings to decompose sub-linearised polynomials without asymptotic cost.

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

On the Asymptotic Behavior of the Ratio between the Numbers of Binary Primitive and Irreducible Polynomials

This work was presented in part at the 8th International Conference on Finite Fields and Applications Fq^8 , Melbourne, Australia, 9-13 July, 2007.