Interlacing properties and the Schur-Szegő composition

Each degree n polynomial in one variable of the form (x+1)(x ^n?1+c ₁ x ^n?2+???+c _n?1) is representable in a unique way as a Schur-Szeg? composition of n?1 polynomials of the form (x+1) ^n?1(x+a _i ), see Kostov (2003), Alkhatib and Kostov (2008) and Kostov (Mathematica Balkanica 22, 2008). Set $\sigma _{j}:=\sum _{1\leq i_{1}<\cdots <i_{j}\leq n-1}a_{i_{1}}\cdots a_{i_{j}}$ . The eigenvalues of the affine mapping (c ₁,…,c _n?1)?(σ ₁,…,σ _n?1) are positive rational numbers and its eigenvectors are defined by hyperbolic polynomials (i.e. with real roots only). In the present paper we prove interlacing properties of the roots of these polynomials.     

A method of constructing Krall's polynomials

We propose a method of constructing orthogonal polynomials P_n(x) (Krall's polynomials) that are eigenfunctions of higher-order differential operators. Using this method we show that recurrence coefficients of Krall's polynomials P_n(x) are rational functions of n. Let P_n^(a,b;M)(x) be polynomials obtained from the Jacobi polynomials P_n^(a,b)(x) by the following procedure. We add an arbitrary concentrated mass M at the endpoint of the orthogonality interval with respect to the weight function of the ordinary Jacobi polynomials. We find necessary conditions for the parameters a,b in order for the polynomials P_n^(a,b;M)(x) to obey a higher-order differential equation. The main result of the paper is the following. Let a be a positive integer and b⩾−1/2 an arbitrary real parameter. Then the polynomials P_n^(a,b;M)(x) are Krall's polynomials satisfying a differential equation of order 2a+4.     

Elliptic equation with a singular potential in a domain with a conic point

This paper deals with the behavior of the nonnegative solutions of the problem $$- \Delta u = V(x)u, \left. u \right|\partial \Omega = \varphi (x)$$ in a conical domain Ω ? ? ⁿ , n ≥ 3, where 0 ≤ V (x) ∈ L₁(Ω), 0 ≤ ?(x) ∈ L₁(?Ω) and ?(x) is continuous on the boundary ?Ω. It is proved that there exists a constant C _*(n) = (n ? 2)²/4 such that if V ₀(x) = (c + λ ₁)|x|^?2, then, for 0 ≤ c ≤ C _*(n) and V(x) ≤ V ₀(x) in the domain Ω, this problem has a nonnegative solution for any nonnegative boundary function ?(x) ∈ L ₁(?Ω); for c > C _*(n) and V(x) ≥ V ₀(x) in Ω, this problem has no nonnegative solutions if ?(x) > 0.     

High-Order Three-Term Recursions, Riemann–Hilbert Minors and Nikishin Systems on Star-Like Sets

We study monic polynomials Q _n (x) generated by a high-order three-term recursion xQ _n (x)=Q _n+1(x)+a _n?p Q _n?p (x) with arbitrary p≥1 and a _n >0 for all n. The recursion is encoded by a two-diagonal Hessenberg operator H. One of our main results is that, for periodic coefficients a _n and under certain conditions, the Q _n are multiple orthogonal polynomials with respect to a Nikishin system of orthogonality measures supported on star-like sets in the complex plane. This improves a recent result of Aptekarev–Kalyagin–Saff, where a formal connection with Nikishin systems was obtained in the case when $\sum_{n=0}^{\infty}|a_{n}-a|<\infty$ for some a>0. An important tool in this paper is the study of ‘Riemann–Hilbert minors’, or equivalently, the ‘generalized eigenvalues’ of the Hessenberg matrix H. We prove interlacing relations for the generalized eigenvalues by using totally positive matrices. In the case of asymptotically periodic coefficients a _n , we find weak and ratio asymptotics for the Riemann–Hilbert minors and we obtain a connection with a vector equilibrium problem. We anticipate that in the future, the study of Riemann–Hilbert minors may prove useful for more general classes of multiple orthogonal polynomials.     

Laguerre polynomial expansions in indefinite inner product spaces

When ?j ? 1 < α < ?j, where j is a positive integer, the Laguerre polynomials {L_n^(α)}_{n = 0}^∞ form a complete orthogonal set in a nondegenerate inner product space H which is defined by employing an appropriate regularized linear functional on H^(j)[[0, ∞); x^{α + j}e^?x]. Expansions in terms of these Laguerre polynomials are exhibited. The Laguerre differential operator is shown to be self-adjoint with real, discrete, integer eigenvalues. Its spectral resolution and resolvent are exhibited and discussed.     

A convex polynomial that is not sos-convex

A multivariate polynomial p(x)?=?p(x ₁, . . . , x _n ) is sos-convex if its Hessian H(x) can be factored as H(x)?= M ^T (x) M(x) with a possibly nonsquare polynomial matrix M(x). It is easy to see that sos-convexity is a sufficient condition for convexity of p(x). Moreover, the problem of deciding sos-convexity of a polynomial can be cast as the feasibility of a semidefinite program, which can be solved efficiently. Motivated by this computational tractability, it is natural to study whether sos-convexity is also a necessary condition for convexity of polynomials. In this paper, we give a negative answer to this question by presenting an explicit example of a trivariate homogeneous polynomial of degree eight that is convex but not sos-convex.     

Polynomials of least deviation from zero in the L[−1, 1] metric with five fixed coefficients

We study properties of polynomials R _n+5(x) of least deviation from zero in the L[?1, 1] metric, with five given leading coefficients whose forms were calculated previously. Theorems 1 and 2 together with Theorem A contain, in particular, a final classification of polynomials R _n+5(x) that have exactly (n + 1) sign changes in (?1, 1).     

A product quadrature algorithm by Hermite interpolation

This paper is concerned with numerical integration of ∫¹₋₁f(x)k(x)dx by product integration rules based on Hermite interpolation. Special attention is given to the kernel k(x) = e^iτx, with a view to providing high precision rules for oscillatory integrals. Convergence results and error estimates are obtained in the case where the points of integration are zeros of p_n(W; x) or of (1 − x²)p_n−2(W; x), where p_n(W; x), n = 0, 1, 2…, are the orthonormal polynomials associated with a generalized Jacobi weight W. Further, examples are given that test the performance of the algorithm for oscillatory weight functions.     

The Hosoya polynomial decomposition for catacondensed benzenoid graphs

For a graph G with the vertex set V(G), we denote by d(u,v) the distance between vertices u and v in G, by d(u) the degree of vertex u. The Hosoya polynomial of G is H(G)=∑_{u,v}⊆V(G)x^d(u,v). The partial Hosoya polynomials of G are for positive integer numbers m and n. It is shown that H(G₁)−H(G₂)=x²(x+1)²(H₃₃(G₁)−H₃₃(G₂)),H₂₂(G₁)−H₂₂(G₂)=(x²+x−1)²(H₃₃(G₁)−H₃₃(G₂)) and H₂₃(G₁)−H₂₃(G₂)=2(x²+x−1)(H₃₃(G₁)−H₃₃(G₂)) for arbitrary catacondensed benzenoid graphs G₁ and G₂ with equal number of hexagons. As an application, we give an affine relationship between H(G) with two other distance-based polynomials constructed by Gutman [I. Gutman, Some relations between distance-based polynomials of trees, Bulletin de l’Académie Serbe des Sciences et des Arts (Cl. Math. Natur.) 131 (2005) 1-7].     

A combinatorial problem involving graphs and matrices

In this paper we discuss a combinatorial problem involving graphs and matrices. Our problem is a matrix analogue of the classical problem of finding a system of distinct representatives (transversal) of a family of sets and relates closely to an extremal problem involving 1-factors and a long standing conjecture in the dimension theory of partially ordered sets. For an integer n ?1, let n denote the n element set {1,2,3,…, n}. Then let A be a k×t matrix. We say that A satisfies property P(n, k) when the following condition is satisfied: For every k-taple (x₁,x₂,…,x_k?n^k there exist k distinct integers j₁,j₂,…,j_k so that x_i= a_ii for i= 1,2,…,k. The minimum value of t for which there exists a k × t matrix A satisfying property P(n,k) is denoted by f(n,k). For each k?1 and n sufficiently large, we give an explicit formula for f(n, k): for each n?1 and k sufficiently large, we use probabilistic methods to provide inequalities for f(n,k).     

A conjecture of Kippenhahn about the characteristic polynomial of a pencil generated by two Hermitian matrices. II

Let A be an n × n matrix; write A = H+iK, where i²=—1 and H and K are Hermitian. Let f(x,y,z) = det(zI?xH?yK). We first show that a pair of matrices over an algebraically closed field, which satisfy quadratic polynomials, can be put into block, upper triangular form, with diagonal blocks of size 1×1 or 2×2, via a simultaneous similarity. This is used to prove that if $\text{f(x,y,z) = [g(x,y,z)]}{}^{\mathrm{<mtext>n</mtext><mtext>2</mtext>}}$, where g has degree 2, then for some unitary matrix U, the matrix U¹AU is the direct sum of $\text{n}\text{2}$ copies of a 2×2 matrix A₁, where A₁ is determined, up to unitary similarity, by the polynomial g(x,y,z). We use the connection between f(x,y,z) and the numerical range of A to investigate the case where f(x,y,z) has the form (z?αax? βy)^r[g(x,y,z)]^s, where g(x,y,z) is irreducible of degree 2.     

Weighted Least Square Convergence of Lagrange Interpolation on the Unit Circle

In the paper, a result of Walsh and Sharma on least square convergence of Lagrange interpolation polynomials based on the n-th roots of unity is extended to Lagrange interpolation on the sets obtained by projecting vertically the zeros of (1-x)²=P ^(a,β) _n(x),a>0,β>0,(1-x)P^(a,β) _n(x),a>0,β>-1,(1+x)P P^(a,β) _n(x),a>-1,β0 and P^(a,β) _n(x),a>-1,β>-1, respectively, onto the unit circle, where P^(a,β) _n(x),a>-1,β>-1, stands for the n-th Jacobi polynomial. Moreover, a result of Saff and Walsh is also extended.     

Effective Fast Algorithms for Polynomial Spectral Factorization

Let p(z) be a polynomial of degree n having zeros |ξ₁|≤???≤|ξ _m |<1<|ξ _m+1|≤???≤|ξ _n |. This paper is concerned with the problem of efficiently computing the coefficients of the factors u(z)=∏ _i=1 ^m (z?ξ _i ) and l(z)=∏ _i=m+1 ⁿ (z?ξ _i ) of p(z) such that a(z)=z ^?m p(z)=(z ^?m u(z))l(z) is the spectral factorization of a(z). To perform this task the following two-stage approach is considered: first we approximate the central coefficients x _?n+1,. . .x _n?1 of the Laurent series x(z)=∑ _i=?∞ ^+∞ x _i z ⁱ satisfying x(z)a(z)=1; then we determine the entries in the first column and in the first row of the inverse of the Toeplitz matrix T=(x _i?j ) _i,j=?n+1,n?1 which provide the sought coefficients of u(z) and l(z). Two different algorithms are analyzed for the reciprocation of Laurent polynomials. One algorithm makes use of Graeffe's iteration which is quadratically convergent. Differently, the second algorithm directly employs evaluation/interpolation techniques at the roots of 1 and it is linearly convergent only. Algorithmic issues and numerical experiments are discussed.     

A polynomial dual of partitions

Let P(x) = Σ_i=0ⁿa_ixⁱ be a nonnegative integral polynomial. The polynomial P(x) is m-graphical, and a multi-graph G a realization of P(x), provided there exists a multi-graph G containing exactly P(1) points where a_i of these points have degree i for 0≤i≤n. For multigraphs G, H having polynomials P(x), Q(x) and number-theoretic partitions (degree sequences) π, ?, the usual product P(x)Q(x) is shown to be the polynomial of the Cartesian product G × H, thus inducing a natural product π? which extends that of juxtaposing integral multiple copies of ?. Skeletal results are given on synthesizing a multi-graph G via a natural Cartesian product G₁ × … × G_k having the same polynomial (partition) as G. Other results include an elementary sufficient condition for arbitrary nonnegative integral polynomials to be graphical.     

Companion orthogonal polynomials

We give some properties relating the recurrence relations of orthogonal polynomials associated with any two symmetric distributions dφ₁(x) and d₂(x) such that dφ₂(x) = (1 + kx²)d₁(x). As applications of properties, recurrence relations for many interesting systems of orthogonal polynomials are obtained.     

Rectangular arrays

In this paper we studied m×n arrays with row sums $\text{nr}\text{(n,m)}$ and column sums $\text{mr}\text{(n,m)}$ where (n,m) denotes the greatest common divisor of m and n. We were able to show that the function H_m,n(r), which enumerates m×n arrays with row sums and column sums $\text{nr}\text{(m,n)}$ and $\text{mr}\text{(n,m)}$ respectively, is a polynomial in r of degree (m?1)(n?1). We found simple formulas to evaluate these polynomials for negative values, ?r, and we show that certain small negative integers are roots of these polynomials. When we considered the generating function G_m,n(y) = Σ_r?0H_m,n(r)y^r, it was found to be rational of degree less than zero. The denominator of G_m,n(y) is of the form (1?y)^(m?1)(n?1)+3, and the coefficients of the numerator are non-negative integers which enjoy a certain symmetric relation.     

On the convergence of averaging Hermite interpolators

We investigate two sequences of polynomial operators, H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x), of degrees 2n − 2 and 2n − 3, respectively, defined by interpolatory conditions similar to those of the classical Hermite-Féjer interpolators H_{2n − 1}(f, x). If H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x) are based on the zeros of the jacobi polynomials P_n^(α,β)(x), their convergence behaviour is similar to that of H_{2n − 1}(f;, x). If they are based on the zeros of (1 − x²)T_{n − 2}(x), their convergence behaviour is better, in some sense, than that of H_{2n − 1}(f, x).     

Uniform and mean approximation by certain weighted polynomials,with applications

LetW(x):= exp(-{tiQ(x})), where, for example, Q(x) is even and convex onR, and Q(x)/logx → ∞ asx → ∞. A result of Mhaskar and Saff asserts that ifa _n =a _n (W) is the positive root of the equation $$n = ({2 \mathord{\left/ {\vphantom {2 \pi }} \right. \kern-\nulldelimiterspace} \pi })\int_0^1 {{{a_n xQ'(a_n x)} \mathord{\left/ {\vphantom {{a_n xQ'(a_n x)} {\sqrt {1 - x^2 } }}} \right. \kern-\nulldelimiterspace} {\sqrt {1 - x^2 } }}dx,}$$ then, given any polynomialP _n(x) of degree at mostn, the sup norm ofP _n(x)W(a _n x) overR is attained on [-1, 1]. In addition, any sequence of weighted polynomials {p _n (x)W(a _n x)} ₁ ^∞ that is uniformly bounded onR will converge to 0, for ¦x¦>1. In this paper we show that under certain conditions onW, a function g(x) continuous inR can be approximated in the uniform norm by such a sequence {p _n (x)W(a _n x)} ₁ ^∞ if and only if g(x)=0 for ¦x¦? 1. We also prove anL _p analogue for 0W(x)=exp(?|x| ^α ), when α >1. Further applications of our results are upper bounds for Christoffel functions, and asymptotic behavior of the largest zeros of orthogonal polynomials. A final application is an approximation theorem that will be used in a forthcoming proof of Freud's conjecture for |x| ^p exp(?|x| ^α ),α > 0,p > ?1.     

On the asymptotic behavior of the bestL ∞-approximation by polynomials

LetE _n (f) denote the sup-norm-distance (with respect to the interval [?1, 1]) betweenf and the set of real polynomials of degree not exceedingn. For functions likee ^x , cosx, etc., the order ofE _n (f) asn→∞ is well known. A typical result is $$2^{n - 1} n!E_{n - 1} (e^x ) = 1 + 1/4n + O(n^{ - 2} ).$$ It is shown in this paper that 2 ^n?1 n!E _n?1(e ^x ) possesses a complete asymptotic expansion. This result is contained in the more general result that for a wide class of entire functions (containing, for example, exp(cx), coscx, and the Bessel functionsJ _k (x)) the quantity $$2^{n - 1} n!E_{n - 1} \left( f \right)/f^{(n)} \left( 0 \right)$$ possesses a complete asymptotic expansion (providedn is always even (resp. always odd) iff is even (resp. odd)).