Search arXivSearch

arXiv · 2407.07508

Combinatorics of orthogonal polynomials on the unit circle

Abstract

Orthogonal polynomials on the unit circle (OPUC for short) are a family of polynomials whose orthogonality is given by integration over the unit circle in the complex plane. There are combinatorial studies on the moments of various types of orthogonal polynomials, including standard orthogonal polynomials, Laurent biorthogonal polynomials, and orthogonal polynomials of type \( R_I \). In this paper, we study the moments of OPUC from a combinatorial perspective. We provide three path interpretations for them: Łukasiewicz paths, gentle Motzkin paths, and Schröder paths. Additionally, using these combinatorial interpretations, we derive explicit formulas for the generalized moments of some examples of OPUC, including the circular Jacobi polynomials and the Rogers--Szegő polynomials. Furthermore, we introduce several kinds of generalized linearization coefficients and give combinatorial interpretations for them.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jihyeug Jang, Minho Song. 2025-09-08. Combinatorics of orthogonal polynomials on the unit circle. https://arxiv.org/abs/2407.07508

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO