A finite class of orthogonal functions generated by Routh-Romanovski polynomials

It is known that some orthogonal systems are mapped onto other orthogonal systems by the Fourier transform. In this article we introduce a finite class of orthogonal functions, which is the Fourier transform of Routh-Romanovski orthogonal polynomials, and obtain its orthogonality relation using Parseval identity.

Bivariate Krawtchouk polynomials: Inversion and connection problems with the NAVIMA algorithm

In this paper we present a recurrent procedure to solve an inversion problem for monic bivariate Krawtchouk polynomials written in vector column form, giving its solution explicitly. As a by-product, a general connection problem between two vector column of monic bivariate Krawtchouk families is also explicitly solved. Moreover, in the non monic case and also for Krawtchouk families, several expansion formulas are given, but for polynomials written in scalar form.

Solution of the pulse width modulation problem using orthogonal polynomials and Korteweg-de Vries equations

The mathematical underpinning of the pulse width modulation (PWM) technique lies in the attempt to represent “accurately” harmonic waveforms using only square forms of a fixed height. The accuracy can be measured using many norms, but the quality of the approximation of the analog signal (a harmonic form) by a digital one (simple pulses of a fixed high voltage level) requires the elimination of high order harmonics in the error term. The most important practical problem is in “accurate” reproduction of sine-wave using the same number of pulses as the number of high harmonics eliminated. We describe in this paper a complete solution of the PWM problem using Padé approximations, orthogonal polynomials, and solitons. The main result of the paper is the characterization of discrete pulses answering the general PWM problem in terms of the manifold of all rational solutions to Korteweg-de Vries equations.

A positivity result in the theory of Macdonald polynomials

We outline here a proof that a certain rational function Cn(q, t), which has come to be known as the “q, t-Catalan,” is in fact a polynomial with positive integer coefficients. This has been an open problem since 1994. Because Cn(q, t) evaluates to the Catalan number at t = q = 1, it has also been an open problem to find a pair of statistics a, b on the collection

Robust fitting of Zernike polynomials to noisy point clouds defined over connected domains of arbitrary shape

A new method for fitting a series of Zernike polynomials to point clouds defined over connected domains of arbitrary shape defined within the unit circle is presented in this work. The method is based on the application of machine learning fitting techniques by constructing an extended training set in order to ensure the smooth variation of local curvature over the whole domain. Therefore this technique is best suited for fitting points corresponding to ophthalmic lenses surfaces, particularly progressive power ones, in non-regular domains. We have tested our method by fitting numerical and real surfaces reaching an accuracy of 1 micron in elevation and 0.1 D in local curvature in agreement with the customary tolerances in the ophthalmic manufacturing industry.

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.)"