English
Related papers

Related papers: On recurrence coefficients of classical orthogonal…

200 papers

We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form. This yields, in a natural way, an explicit formula for both the Lame polynomials and the classical non-meromorphic Lame functions in terms of Chebyshev polynomials…

Mathematical Physics · Physics 2009-10-31 F. Finkel , A. Gonzalez-Lopez , M. A. Rodriguez

Given a sequence of polynomials $(p_n)_n$, an algebra of operators $\mathcal{A}$ acting in the linear space of polynomials and an operator $D_p\in \mathcal{A}$ with $D_p(p_n)=np_n$, we form a new sequence of polynomials $(q_n)_n$ by…

Classical Analysis and ODEs · Mathematics 2013-07-05 Antonio J. Durán , Manuel D. de la Iglesia

We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…

Combinatorics · Mathematics 2021-09-13 Ben Brubaker , Claire Frechette , Andrew Hardt , Emily Tibor , Katherine Weber

We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by…

Classical Analysis and ODEs · Mathematics 2024-01-11 Percy Deift , Mateusz Piorkowski

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

Combinatorics · Mathematics 2013-01-29 Roland Grinis , Alexander Kasprzyk

In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…

Classical Analysis and ODEs · Mathematics 2023-06-01 Amílcar Branquinho , Ana Foulquié-Moreno , Assil Fradi , Manuel Mañas

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

Discrete Mathematics · Computer Science 2018-01-08 Ranveer Singh , R. B. Bapat

In this paper we consider a general sequence of orthogonal Laurent polynomials on the unit circle and we first study the equivalences between recurrences for such families and Szego's recursion and the structure of the matrix representation…

Numerical Analysis · Mathematics 2007-05-23 Maria Jose Cantero , Ruyman Cruz-Barroso , Pablo Gonzalez-Vera

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…

q-alg · Mathematics 2010-09-28 Jan F. van Diejen

Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for…

Information Theory · Computer Science 2011-07-11 Philip Feinsilver , René Schott

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Algebraic Geometry · Mathematics 2009-06-03 A. I. Molev

We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…

Combinatorics · Mathematics 2017-06-20 Nicholas Proudfoot , Ben Young , Yuan Xu

A linear functional $\bf u$ is classical if there exist polynomials, $\phi$ and $\psi$, with $\deg \phi\le 2$, $\deg \psi=1$, such that ${\mathscr D}\left(\phi(x) {\bf u}\right)=\psi(x){\bf u}$, where ${\mathscr D}$ is a certain…

Classical Analysis and ODEs · Mathematics 2025-01-23 Roberto S. Costas-Santos

Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić , Darko Veljan

We analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which involves the outward normal derivatives on the sphere. Using their representation in terms of spherical harmonics, algebraic and…

Classical Analysis and ODEs · Mathematics 2015-12-04 Antonia M. Delgado , Lidia Fernández , Doron Lubinsky , Teresa E. Pérez , Miguel A. Piñar

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…

Computational Complexity · Computer Science 2025-10-21 Greta Panova

We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…

Combinatorics · Mathematics 2009-07-02 A. Luzon , M. A. Morón

We prove that the sequence of the characters of the Kirillov-Reshetikhin (KR) modules $W_{m}^{(a)}, m\in \mathbb{Z}_{m\geq 0}$ associated to a node $a$ of the Dynkin diagram of a complex simple Lie algebra $\mathfrak{g}$ satisfies a linear…

Representation Theory · Mathematics 2017-04-25 Chul-hee Lee