Skip to content
Preprint

Romanovski polynomials, Gegenbauer connections, and $\mathrm{su}(1,1)$ ladder structures

Aug 2026 · 0 citations · 27 references
Physics Mathematics

Abstract

We study the monic Romanovski (pseudo-Jacobi) polynomials with degree dependent parameters $\beta_K=-K$ and $\alpha_K=c/(K+1)$. We write out the parameter preserving first order ladder relations at fixed $(\alpha,\beta)$, with real constants. Combining them returns the three-term recurrence; iterating them builds $R_n^{\alpha,\beta}$ from the constant polynomial. We solve in triangular form the connection problem with the $\alpha=0$ family, identified with the Gegenbauer polynomials, and transfer the ladder relations to the $(n,\ell)$ lattice. Under $x=\cot\chi$ the in-level operators depend on $\ell$ alone. The dressed functions carry intrinsic lowest weight $\mathrm{su}(1,1)$ modules along columns of fixed $\ell$; rows need a boundary prescription and a rescaling. The deformed functions carry the same modules through higher order operators, which yield relations between Romanovski polynomials with different parameter pairs. Algebraically the family lies in the Jacobi class, and we indicate throughout which statements are inherited from that framework by transformation or specialization and which are not.

View source

Similar papers

Preprint Sep 2026

Evaluating $\mathrm {SU}(3)$ Verlinde sums using spectral graph theory

We realize the $\mathrm{SU}(3)$ Verlinde sums $V_n(m)$, up to an explicit factor, as the values at $n$ of the spectral zeta function of a higher-order Laplace operator on the triangular discrete torus on $m^2$ vertices. For fixed $m$, we express their generating function in terms of the logarithmic derivative of an ass...

J. Jorgenson, A. Karlsson, L. Smajlović · 0 citations
Preprint Nov 2026

An operator $b$-positivity conjecture for Jack characters

Goulden and Jackson defined a Jack deformation $a_{\mu\nu}^\lambda(\alpha)$ of the connection coefficients of the symmetric group and conjectured that these were polynomials in $b=\alpha-1$ with nonnegative interger coefficients. This conjecture was extended to the structure constants of (stable) Jack characters by \'S...

J. Thibon · 0 citations
Preprint Nov 2026

Weighted Euler transforms, real-rootedness, and $\gamma$-positivity

For $a>0$ and a polynomial $F$ of degree $m$, let $H_{a,F}$ denote the weighted Euler numerator of $F$, defined as the numerator of the generating function $\sum_{k\ge0}(a)_kF(k)x^k/k!$ with denominator $(1-x)^{a+m}$. For every $a>0$, we show the following preservation result: if the numerators $H_{a,F}$ and $H_{a,G}$...

Yi-Nuo Cheng, G. Xin · 0 citations
Preprint Oct 2026

Averages of Artin characters and their relation to the Davenport--Heilbronn theorem

We bound the error term in the counting function of cubic extensions of $\mathbb{Q}$ by $\mathcal{O}_\epsilon(X^{\theta+\epsilon})$, with $\theta<2/3$, improving upon results due to Bhargava, Taniguchi, and Thorne. The proof proceeds by relating a certain discriminant-reducing sieve, due to Bhargava, Shankar, and Tsime...

Victor Ahlquist · 0 citations
Preprint Sep 2026

Generalized Charlier Recurrence Coefficients: Hankel Formulas, Laguerre--Freud Dynamics, and Painlev\'e V Connections

We study the monic recurrence coefficients of the generalized Charlier polynomials associated with the discrete weight \[ \rho_\mu(k) = \frac{\mu^k}{(k!)^2}, \qquad k\in\mathbb N_0, \qquad \mu>0. \] The coefficients $\beta_n$ and $\gamma_n$ in the recurrence relation \[ P_{n+1}(x) = (x-\beta_n)P_n(x)-\gamma_nP_{n-1}(x)...

M. N. Hounkonnou · 0 citations
Preprint Nov 2026

Correlators of the Jacobi Unitary Ensemble on a General Interval and Hurwitz Numbers

We study correlators of the Jacobi Unitary Ensemble $\mathbf J(p,q,\alpha,\beta,N)$ of Hermitian matrices with spectrum in an arbitrary real interval $[p,q]$. For $(p,q)=(0,1)$, Gisonni, Grava and Ruzza expressed the large-$N$ expansion of the correlators $\langle\prod_j \mathrm{tr}\,X^{\lambda_j}\rangle$ through tripl...

M. Sushkov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.