Colored interlacing triangles and Genocchi medians
Natasha Blitvic, Leonid Petrov
TL;DR
This work resolves the depth-$2$ enumeration of colored interlacing triangles by establishing a bijection with Dumont derangements, yielding $T_2(n)=n!\,H_n$ where $H_n$ are Genocchi medians, and introduces a natural $q$-deformation $T_2(n;q)$ arising from the LLT transition energy, producing new $q$-analogs of Genocchi medians. It also defines the inter-level statistic $\psi$ to weight $N$-level transitions and proves that for $N=2$ the corresponding polynomials $T_2(n;q)$ are palindromic with degree $\binom{n}{2}$ and divisibility by $2^{n-1}$, while revealing structural properties such as linear cumulants and refined bottom-row decompositions. The paper provides substantial computational data, including GPU-accelerated enumeration of $T_N(n)$ and explicit $P_n(q)$ for $n\le 9$, and develops a Markov chain Monte Carlo sampler for the $q$-weighted depth-$2$ ensemble, revealing a Mallows-like permutation structure in the limit. Together, these results connect the LLT-based probabilistic model to classical combinatorics (Genocchi medians, Dumont derangements) and delineate the computational and combinatorial boundaries of tractability in the $(N,n)$ parameter space.
Abstract
Colored interlacing triangles, introduced by Aggarwal-Borodin-Wheeler (2024), provide the combinatorial framework for the Central Limit Theorem for probability measures arising from the Lascoux-Leclerc-Thibon (LLT) polynomials. Colored interlacing triangles depend on two key parameters: the number of colors $n$ and the depth of the triangle $N$. Recent work of Gaetz-Gao (2025) connects these objects to Schubert calculus and resolves the enumeration for $n=3$ and arbitrary depth $N$. However, the enumerative behavior for general $n$ has remained open. In this paper, we analyze the complementary regime: fixed depth $N=2$ and arbitrary number of colors $n$. We prove that in this setting, colored interlacing triangles are in bijection with Dumont derangements, identifying their enumeration with the Genocchi medians. This connects the probabilistic model to a rich hierarchy of classical combinatorial objects. Furthermore, we introduce a $q$-deformation of this enumeration arising naturally from the LLT transition energy. This yields new $q$-analogs of the Genocchi medians. Finally, we present computational results and sampling algorithms for colored interlacing triangles with higher $N$ or $n$, which suggests the limits of combinatorial tractability in the $(N,n)$ parameter space.
