Sums of two polynomials with each having real zeros symmetric with the other

Consider the polynomial equation

Relative asymptotics and Fourier series of orthogonal polynomials with a discrete Sobolev inner product

Let μ be a finite positive Borel measure supported in [−1,1] and introduce the discrete Sobolev-type inner product

where the mass points a_k belong to [−1,1], M_k,i0, i=0,…,N_k−1, and M_k,Nk>0. In this paper, we study the asymptotics of the Sobolev orthogonal polynomials by comparison with the orthogonal polynomials with respect to the measure μ and we prove that they have the same asymptotic behaviour. We also study the pointwise convergence of the Fourier series associated to this inner product provided that μ is the Jacobi measure. We generalize the work done by F. Marcellán and W. Van Assche where they studied the asymptotics for only one mass point in [−1,1]. The same problem with a finite number of mass points off [−1,1] was solved by G. López, F. Marcellán and W. Van Assche in a more general setting: they consider the constants M_k,i to be complex numbers. As regards the Fourier series, we continue the results achieved by F. Marcellán, B. Osilenker and I.A. Rocha for the Jacobi measure and mass points in .     

A proof of a conjecture about a symmetric system of orthogonal polynomials

ABSTRACT

The purpose of this note is to give an affirmative answer to a conjecture appearing in Berg [Open problems. Integral Transforms Spec Funct. 2015;26(2):90–95].     

Positive polynomials on projective limits of real algebraic varieties

We reveal some important geometric aspects related to non-convex optimization of sparse polynomials. The main result, a Positivstellensatz on the fibre product of real algebraic affine varieties, is iterated to a comprehensive class of projective limits of such varieties. This framework includes as necessary ingredients recent works on the multivariate moment problem, disintegration and projective limits of probability measures and basic techniques of the theory of locally convex vector spaces. A variety of applications illustrate the versatility of this novel geometric approach to polynomial optimization.     

Some inequalities for symmetric functions and an application to orthogonal polynomials

We present some sharp inequalities for symmetric functions and give an application to orthogonal polynomials.     

Asymptotics of orthogonal polynomials beyond the scope of Szegő’s theorem

First, we give a simple proof of a remarkable result due to Videnskii and Shirokov: let B be a Blaschke product with n zeros; then there exists an outer function φ, φ(0) = 1, such that ‖(Bφ)′‖ ? Cn, where C is an absolute constant. Then we apply this result to a certain problem of finding the asymptotics of orthogonal polynomials.     

Extensions of Laguerre operators in indefinite inner product spaces

The Laguerre-Sonin polynomialsL _n ⁽⁾ are orthogonal in linear spaces with indefinite inner product if<–1. We construct the completion () of this space and describe self-adjoint extensions of the Laguerre operatorl(y)=xy+(1+–x)y,<–1, in the space (). In particular, we write out the self-adjoint extension of the Laguerre operator whose eigenfunctions coincide with the Laguerre-Sonin polynomials and form an orthogonal basis in ().Translated fromMatematicheskie Zametki, Vol. 63, No. 4, pp. 509–521, April, 1998.This research was partially supported by the INTAS foundation under grant No. 93-02449.     

On Markov operators preserving polynomials

The paper is concerned with a special class of positive linear operators acting on the space C(K)$C(K)$ of all continuous functions defined on a convex compact subset K   of R^d${\mathbf{R}}^d$, d?1$d?1$, having non-empty interior. Actually, this class consists of all positive linear operators T   on C(K)$C(K)$ which leave invariant the polynomials of degree at most 1 and which, in addition, map polynomials into polynomials of the same degree. Among other things, we discuss the existence of such operators in the special case where K is strictly convex by also characterizing them within the class of positive projections. In particular we show that such operators exist if and only if ∂K   is an ellipsoid. Furthermore, a characterization of balls of R^d${\mathbf{R}}^d$ in terms of a special class of them is furnished. Additional results and illustrative examples are presented as well.     

Polynomial functions and permutation polynomials over some finite commutative rings

We extend some classical results on polynomial functions . We prove all results in algebraic methods avoiding any combinatorial calculation. As applications of our methods, we obtain some interesting new results on permutation polynomials in several variables over some finite commutative rings.     

The continuous symmetric Hahn polynomials found in Ramanujan's lost notebook

Askey and Wilson found Hahn polynomials which are orthogonal with respect to a positive absolutely continuous weight function. More than a half century earlier, Ramanujan recorded the Stieltjes transform of this weight function in terms of a continued fraction in his lost notebook. We provide two different proofs for this integration. One applies theories of the Hamburger moment problem. The other uses elementary integration techniques and a couple of transformation formulas for hypergeometric functions.     

Limits for Szegö polynomials in frequency analysis

We characterize limits for orthogonal Szegö polynomials of fixed degree k, with respect to certain measures on the unit circle which are weakly convergent to a sum of m<k point masses. Such measures arise, for example, as a convolution of point masses with an approximate identity. It is readily seen that the underlying measures in two recently-proposed methods for estimating the m frequencies, θj, of a discrete-time trigonometric signal using Szegö polynomials are of this form. We prove existence of Szegö polynomial limits associated with a general class of weakly convergent measures, and prove that for convolution of point masses with the Poisson kernel, which underlies one of the recently-proposed methods, the limit has as a factor the Szegö polynomial with respect to a related measure, which we specify. Since m of the zeros approach the eiθj, this result uniquely characterizes the limit. A similar result is obtained for measures consisting of point masses with additive absolutely continuous part.     

Tauberian polynomials

In this paper we introduce and study the notion of homogeneous Tauberian polynomial, aiming at extending the concept of Tauberian operator. Such notion is characterized in terms of the polynomial topology for which we prove a Banach–Alaoglu type theorem. A number of examples show that the behavior of Tauberian polynomials differs from that of Tauberian operators.     

On a class of Sobolev scalar products in the polynomials

This paper discusses Sobolev orthogonal polynomials for a class of scalar products that contains the sequentially dominated products introduced by Lagomasino and Pijeira. We prove asymptotics for Markov type functions associated to the Sobolev scalar product and an extension of Widom's Theorem on the location of the zeroes of the orthogonal polynomials. In the case of measures supported in the real line, we obtain results related to the determinacy of the Sobolev moment problem and the completeness of the polynomials in a suitably defined weighted Sobolev space.     

Computer algebra systems and theorems on real roots of polynomials

A computer algebra system is used to derive a theorem on the existence of roots of a quadratic equation on any bounded real interval. This is extended to a cubic polynomial. We discuss how students could be led to derive and prove these theorems.     

Sparsity in sums of squares of polynomials

Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and semidefinite programming (SDP) relaxation of polynomial optimization problems. We discuss effective methods to obtain a simpler representation of a sparse polynomial as a sum of squares of sparse polynomials by eliminating redundancy.A considerable part of this work was conducted while this author was visiting Tokyo Institute of Technology. Research supported by Kosef R004-000-2001-00200Mathematics Subject Classification (1991): 90C22, 90C26, 90C30     

Newman polynomials with prescribed vanishing and integer sets with distinct subset sums

We study the problem of determining the minimal degree of a polynomial that has all coefficients in and a zero of multiplicity at . We show that a greedy solution is optimal precisely when , mirroring a result of Boyd on polynomials with coefficients. We then examine polynomials of the form , where is a set of positive odd integers with distinct subset sums, and we develop algorithms to determine the minimal degree of such a polynomial. We determine that satisfies inequalities of the form . Last, we consider the related problem of finding a set of positive integers with distinct subset sums and minimal largest element and show that the Conway-Guy sequence yields the optimal solution for , extending some computations of Lunnon.