384 research outputs found

    Some recent results on the zeros of Bessel functions and orthogonal polynomials

    Get PDF
    AbstractSeveral recent results are encountered on the zeros of Bessel functions and of the classical orthogonal polynomials, many of them are waiting for being published. Four problems are formulated as conjectures

    Zeros of Jacobi polynomials and associated inequalities

    Get PDF
    A Dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the Degree of Master of Science. Johannesburg 2015.This Dissertation focuses on the Jacobi polynomial. Specifically, it discusses certain aspects of the zeros of the Jacobi polynomial such as the interlacing property and quasiorthogonality. Also found in the Dissertation is a chapter on the inequalities of the zeros of the Jacobi polynomial, mainly those developed by Walter Gautschi

    Zeros of Quasi-Orthogonal Jacobi Polynomials

    Get PDF
    We consider interlacing properties satisfied by the zeros of Jacobi polynomials in quasi-orthogonal sequences characterised by α>1\alpha>-1, 2<β<1-2<\beta<-1. We give necessary and sufficient conditions under which a conjecture by Askey, that the zeros of Jacobi polynomials Pn(α,β)P_n^{(\alpha, \beta)} and Pn(α,β+2)P_{n}^{(\alpha,\beta+2)} are interlacing, holds when the parameters α\alpha and β\beta are in the range α>1\alpha>-1 and 2<β<1-2<\beta<-1. We prove that the zeros of Pn(α,β)P_n^{(\alpha, \beta)} and Pn+1(α,β)P_{n+1}^{(\alpha,\beta)} do not interlace for any nNn\in\mathbb{N}, n2n\geq2 and any fixed α\alpha, β\beta with α>1\alpha>-1, 2<β<1-2<\beta<-1. The interlacing of zeros of Pn(α,β)P_n^{(\alpha,\beta)} and Pm(α,β+t)P_m^{(\alpha,\beta+t)} for m,nNm,n\in\mathbb{N} is discussed for α\alpha and β\beta in this range, t1t\geq 1, and new upper and lower bounds are derived for the zero of Pn(α,β)P_n^{(\alpha,\beta)} that is less than 1-1

    On Asymptotics of Polynomial Eigenfunctions for Exactly-Solvable Differential Operators

    Get PDF
    In this paper we study the asymptotic zero distribution of eigenpolynomials for degenerate exactly-solvable operators. We present an explicit conjecture and partial results on the growth of the largest modulus of the roots of the unique and monic n:th degree eigenpolynomial of any such operator as the degree n tends to infinity. Based on this conjecture we deduce the algebraic equation satified by the Cauchy transform of the asymptotic root measure of the properly scaled eigenpolynomials, for which the union of all roots is conjecturally contained in a compact set.Comment: 36 pages, 37 figures, to appear in Journal of Approximation Theor

    Inequalities for Extreme Zeros of Some Classical Orthogonal and q-orthogonal Polynomials

    Get PDF
    Let {pn}1 n=0 be a sequence of orthogonal polynomials. We briefly review properties of pn that have been used to derive upper and lower bounds for the largest and smallest zero of pn. Bounds for the extreme zeros of Laguerre, Jacobi and Gegenbauer polynomials that have been obtained using different approaches are numerically compared and new bounds for extreme zeros of q-Laguerre and little q-Jacobi polynomials are proved

    Zeros of polynomials orthogonal with respect to a signed weight

    Get PDF
    AbstractIn this paper we consider the monic polynomial sequence (Pnα,q(x)) that is orthogonal on [−1,1] with respect to the weight function x2q+1(1−x2)α(1−x),α>−1,q∈N; we obtain the coefficients of the tree-term recurrence relation(TTRR) by using a different method from the one derived in Atia et al. (2002) [2]; we prove that the interlacing property does not hold properly for (Pnα,q(x)); and we also prove that, if xn,nα+i,q+j is the largest zero of Pnα+i,q+j(x), x2n−2j,2n−2jα+j,q+j<x2n−2i,2n−2iα+i,q+i,0≤i<j≤n−1

    Functions preserving nonnegativity of matrices

    Full text link
    The main goal of this work is to determine which entire functions preserve nonnegativity of matrices of a fixed order nn -- i.e., to characterize entire functions ff with the property that f(A)f(A) is entrywise nonnegative for every entrywise nonnegative matrix AA of size n×nn\times n. Towards this goal, we present a complete characterization of functions preserving nonnegativity of (block) upper-triangular matrices and those preserving nonnegativity of circulant matrices. We also derive necessary conditions and sufficient conditions for entire functions that preserve nonnegativity of symmetric matrices. We also show that some of these latter conditions characterize the even or odd functions that preserve nonnegativity of symmetric matrices.Comment: 20 pages; expanded and corrected to reflect referees' remarks; to appear in SIAM J. Matrix Anal. App

    Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions

    Get PDF
    I show that there exist universal constants C(r)<C(r) < \infty such that, for all loopless graphs GG of maximum degree r\le r, the zeros (real or complex) of the chromatic polynomial PG(q)P_G(q) lie in the disc q<C(r)|q| < C(r). Furthermore, C(r)7.963906...rC(r) \le 7.963906... r. This result is a corollary of a more general result on the zeros of the Potts-model partition function ZG(q,ve)Z_G(q, {v_e}) in the complex antiferromagnetic regime 1+ve1|1 + v_e| \le 1. The proof is based on a transformation of the Whitney-Tutte-Fortuin-Kasteleyn representation of ZG(q,ve)Z_G(q, {v_e}) to a polymer gas, followed by verification of the Dobrushin-Koteck\'y-Preiss condition for nonvanishing of a polymer-model partition function. I also show that, for all loopless graphs GG of second-largest degree r\le r, the zeros of PG(q)P_G(q) lie in the disc q<C(r)+1|q| < C(r) + 1. Along the way, I give a simple proof of a generalized (multivariate) Brown-Colbourn conjecture on the zeros of the reliability polynomial for the special case of series-parallel graphs.Comment: 47 pages (LaTeX). Revised version contains slightly simplified proofs of Propositions 4.2 and 4.5. Version 3 fixes a silly error in my proof of Proposition 4.1, and adds related discussion. To appear in Combinatorics, Probability & Computin
    corecore