Search arXivSearch

arXiv · 2606.14241

An explicit formula for Koornwinder moments and Rains' positivity conjecture

Abstract

The asymmetric simple exclusion process (ASEP) is an important particle model with deep connections to orthogonal polynomials. Motivated by this connection, Corteel and Williams introduced the Koornwinder moments $M^{Z}_λ$ at $ t=q $, which generalize the moments of Askey--Wilson polynomials. They showed that the partition function of the two-species ASEP is equal to $M^{Z}_λ$ for a one-row partition $ λ$. In this paper, we investigate a conjecture of Rains on the positivity of the minimal numerator of the Koornwinder moment $M^{Z}_λ$. We derive the first explicit formula for this moment, thereby obtaining a precise formulation of the conjecture by determining the minimal denominator of $M^{Z}_λ$. We also propose a generalization of the conjecture for the more general Koornwinder moments $M^{Z}_{λ,μ}$ indexed by two partitions at special parameter values. We prove the generalized Rains' conjecture in two special cases: $(ξ,q)=(1,0)$ and $(ξ,q)=(1,1)$. For $(ξ,q)=(1,0)$, we construct a lattice path model and obtain a combinatorial formula for $M^{Z}_{λ,μ}$ in terms of non-intersecting lattice paths. For $(ξ,q)=(1,1)$, we establish an explicit product formula for $M^{Z}_{λ,μ}$ and give a combinatorial interpretation using lecture hall tableaux.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Younggwang Cho, Donghyun Kim, Jang Soo Kim, Hojoon Lee, Jing Liu, Minho Song. 2026-06-12. An explicit formula for Koornwinder moments and Rains' positivity conjecture. https://arxiv.org/abs/2606.14241

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO