Blumenthal's theorem for Laurent orthogonal polynomials

We investigate polynomials satisfying a three-term recurrence relation of the form B-n(x) = (x - beta(n))beta(n-1)(x) - alpha(n)xB(n-2)(x), with positive recurrence coefficients alpha(n+1),beta(n) (n = 1, 2,...). We show that the zeros are eigenvalues of a structured Hessenberg matrix and give the left and right eigenvectors of this matrix, from which we deduce Laurent orthogonality and the Gaussian quadrature formula. We analyse in more detail the case where alpha(n) --> alpha and beta(n) --> beta and show that the zeros of beta(n) are dense on an interval and that the support of the Laurent orthogonality measure is equal to this interval and a set which is at most denumerable with accumulation points (if any) at the endpoints of the interval. This result is the Laurent version of Blumenthal's theorem for orthogonal polynomials. (C) 2002 Elsevier B.V. (USA).

Szego polynomials and the truncated trigonometric moment problem

We show how Szego polynomials can be used in the theory of truncated trigonometric moment problem.

Companion orthogonal polynomials

We give some properties relating the recurrence relations of orthogonal polynomials associated with any two symmetric distributions d phi(1)(x) and d phi(2)(x) such that d phi(2)(x) = (I + kx(2))d phi(1)(x). AS applications of these properties, recurrence relations for many interesting systems of orthogonal polynomials are obtained.

Chain sequences and symmetric generalized orthogonal polynomials

in this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K-n((lambda.,M,k)) associated with the probability measure dphi(lambda,M,k;x), which is the Gegenbauer measure of parameter lambda + 1 with two additional mass points at +/-k. When k = 1 we obtain information on the polynomials K-n((lambda.,M)) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K-n((lambda,M,k)) in relation to M and k are also given. (C) 2002 Elsevier B.V. B.V. All rights reserved.

On the existence of infinite heteroclinic cycles in polynomial systems and its dynamic consequences

In this work we consider the dynamic consequences of the existence of infinite heteroclinic cycle in planar polynomial vector fields, which is a trajectory connecting two saddle points at infinity. It is stated that, although the saddles which form the cycle belong to infinity, for certain types of nonautonomous perturbations the perturbed system may present a complex dynamic behavior of the solutions in a finite part of the phase plane, due to the existence of tangencies and transversal intersections of their stable and unstable manifolds. This phenomenon might be called the chaos arising from infinity. The global study at infinity is made via the Poincare Compactification and the argument used to prove the statement is the Birkhoff-Smale Theorem. (c) 2004 WILEY-NCH Verlag GmbH & Co. KGaA, Weinheim.

Szego type polynomials and para-orthogonal polynomials

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Zeros of orthogonal polynomials generated by canonical perturbations of measures

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

SZEGO and PARA-ORTHOGONAL POLYNOMIALS on THE REAL LINE: ZEROS and CANONICAL SPECTRAL TRANSFORMATIONS

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On the Milnor fibre and L numbers of semi-weighted homogeneous arrangements

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On the number of critical periods for planar polynomial systems

In this paper we get some lower bounds for the number of critical periods of families of centers which are perturbations of the linear one. We give a method which lets us prove that there are planar polynomial centers of degree l with at least 2[(l - 2)/2] critical periods as well as study concrete families of potential, reversible and Lienard centers. This last case is studied in more detail and we prove that the number of critical periods obtained with our approach does not. increases with the order of the perturbation. (C) 2007 Elsevier Ltd. All rights reserved.

Squeezed states, generalized Hermite polynomials and pseudo-diffusion equation

We show that the wavefunctions 〈pq; λ|n〈, of the harmonic oscillator in the squeezed state representation, have the generalized Hermite polynomials as their natural orthogonal polynomials. These wavefunctions lead to generalized Poisson Distribution Pn(pq;λ), which satisfy an interesting pseudo-diffusion equation: ∂Pnp,q;λ) ∂λ= 1 4 [ ∂2 ∂p2-( 1 λ2) ∂2 ∂q2]P2(p,q;λ), in which the squeeze parameter λ plays the role of time. Th entropies Sn(λ) have minima at the unsqueezed states (λ=1), which means that squeezing or stretching decreases the correlation between momentum p and position q. © 1992.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Activation function study for wavelet network

The main purpose of this paper is to investigate theoretically and experimentally the use of family of Polynomial Powers of the Sigmoid (PPS) Function Networks applied in speech signal representation and function approximation. This paper carries out practical investigations in terms of approximation fitness (LSE), time consuming (CPU Time), computational complexity (FLOP) and representation power (Number of Activation Function) for different PPS activation functions. We expected that different activation functions can provide performance variations and further investigations will guide us towards a class of mappings associating the best activation function to solve a class of problems under certain criteria.

Quantal information entropies for atoms

The polynomials occurring in the wave functions of hydrogenic excited states are found to present difficulties for a straightforward analytical approach to the study of associated information entropies. A method is suggested to deal with them. It is then applied to calculate the information entropy for the Jacobi polynomial. A model calculation is presented to examine the effect of screening on the entropy sum. It is seen that the sum does not depend on the choice of screening.

Higher order turän inequalities

The celebrated Turân inequalities P 2 n(x)-P n-x(x)P n+1(x) ≥ 0, x ε[-1,1], n ≥ 1, where P n(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ 2 n - γ n-1γ n+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the Laguerre-Pölya class, ψ(x) = ∑ ∞ n=0 γ nx n / n!. ©1998 American Mathematical Society.