Linear cumulant conjecture for colored interlacing triangles

Less than 1 year old · traced to

For each nn, let ak(n)a_k(n) be the coefficients in the polynomial enumerating the relevant colored interlacing triangles by the statistic appearing in the source, and set mk(n)=k!ak(n)m_k(n)=k!a_k(n). Applying the classical moment-cumulant transformation to the sequence (mk(n))k≥1(m_k(n))_{k\geq 1} gives cumulants.

Linear cumulant conjecture. Every cumulant is a linear function of nn for all k≥1k\geq 1.

The first five computed cumulants are linear in nn, as displayed in the source. The conjecture asserts that this pattern persists for every order, but the supplied context does not give a proof or a complete definition of the underlying coefficient sequence and statistic.

References

Primary source

Natasha Blitvic and Leonid Petrov, “Colored interlacing triangles and Genocchi medians”, arXiv:2602.04390 (2026).

Progress summary

Refreshed
Claimed progress

The original conjecture remains unproved, but a posted argument claims eventual linearity of every cumulant once the number of colors is sufficiently large relative to its order.

Blitvić and Petrov (2026) conjecture that every cumulant of the depth-N=2N=2 colored-interlacing-triangle statistic is linear in the number of colors. Their paper computes the first five cumulants and proves the first coefficient formula.

Known results

  • The enumeration at depth N=2N=2 is identified with Genocchi medians (Blitvić and Petrov, 2026).
  • a1(n)=5(n−2)a_1(n)=5(n-2) is proved for n≥3n\geq 3.
  • The first five cumulants are computationally affine in nn.
  • Higher coefficient formulas and the all-order cumulant statement are presented as conjectural, supported by a locality heuristic.

Posted attempt

An unverified argument claims that irreducible configurations of energy rr have size at most 5r+15r+1, yielding an explicit formula showing each cumulant is affine in nn for n≥5rn\geq 5r. This is only a partial result relative to the conjecture, which asserts linearity for all nn, and has not been independently verified.

Current status (as of August 2026): The first five cases and the first coefficient are established computationally or directly, while the all-order conjecture remains open; a posted argument claims eventual linearity for n≥5rn\geq 5r, but that claim is unverified.

Sources

Solutions 1

ProofThis solution needs a summarySee full solutionHide full solution

Proof of the all-order linear-cumulant conjecture. Let

Pn(q)=21−nT2(n;q)=∑r≥0ar(n)qr,κr(n)=r![qr]log⁡Pn(q).P_n(q)=2^{1-n}T_2(n;q)=\sum_{r\ge0}a_r(n)q^r, \qquad \kappa_r(n)=r![q^r]\log P_n(q).

We prove, for every r≥1r\ge1, that κr(n)\kappa_r(n) is exactly affine in nn whenever n≥5rn\ge5r.

The n−1n-1 independent top-row interface involutions from Corollary 2.3 and Proposition 3.4(iii) of the source act freely and preserve the energy ψ\psi. Thus Pn(q)P_n(q) enumerates their orbits, represented by sorting each interface pair. Cutting a canonical configuration at every ordered direct-sum boundary gives its unique sequence of irreducible configurations. Energy is additive under ordered direct sum. Therefore, with C(z,q)C(z,q) the generating function of nonempty irreducible configurations,

F(z,q):=∑n≥0Pn(q)zn=11−C(z,q).(1)F(z,q):=\sum_{n\ge0}P_n(q)z^n=\frac1{1-C(z,q)}. \tag{1}

Here is the finite-energy locality estimate that controls the irreducibles. Let b=(b1,…,bn)b=(b_1,\ldots,b_n) be the bottom permutation, and let AjA_j denote the active colors immediately before its jj-th entry. Interlacing gives ∣Aj∣=j|A_j|=j and bj∈Ajb_j\in A_j. By source equation (3.6),

ej=#{c∈Aj:c>bj},ψ=∑j=1nej.e_j=\#\{c\in A_j:c>b_j\}, \qquad \psi=\sum_{j=1}^n e_j.

Define

hi=#{j≤i:bj>i},D=∑i=1n−1hi=∑j(j−bj)+=∑j(bj−j)+,rj=#(Aj∖[j]).h_i=\#\{j\le i:b_j>i\}, \quad D=\sum_{i=1}^{n-1}h_i =\sum_j(j-b_j)_+ =\sum_j(b_j-j)_+, \quad r_j=\#(A_j\setminus[j]).

Since (j−bj)+≤ej(j-b_j)_+\le e_j,

D≤ψ,rj≤ej+(bj−j)+,∑jrj≤2ψ.(2)D\le\psi, \qquad r_j\le e_j+(b_j-j)_+, \qquad \sum_j r_j\le2\psi. \tag{2}

The following sufficient cut criterion avoids any assumptions about intermediate active-set healing:

hi=ri=ri+1=0⟹i is an ordered direct-sum cut.(3)h_i=r_i=r_{i+1}=0 \quad\Longrightarrow\quad i\text{ is an ordered direct-sum cut}. \tag{3}

Indeed hi=0h_i=0 makes the first ii bottom colors exactly [i][i], while ri=ri+1=0r_i=r_{i+1}=0 gives Ai=[i]A_i=[i] and Ai+1=[i+1]A_{i+1}=[i+1]. The interface pair must therefore consist of bib_i and i+1i+1, in canonical increasing order, separating the two direct-sum blocks.

Every noncut is consequently either an interface with hi>0h_i>0, or is incident to some position with rj>0r_j>0. Each position is incident to at most two interfaces. Hence

#{noncut interfaces}≤D+2∑jrj≤5ψ.\#\{\text{noncut interfaces}\} \le D+2\sum_jr_j \le5\psi.

An irreducible configuration of size nn has n−1n-1 noncuts, and therefore

n≤5ψ+1.(4)n\le5\psi+1. \tag{4}

It follows that

C(z,q)=z+∑r≥1cr(z)qr,cr(z)∈Z[z],deg⁡zcr≤5r+1.(5)C(z,q)=z+\sum_{r\ge1}c_r(z)q^r, \qquad c_r(z)\in\mathbb Z[z], \qquad \deg_z c_r\le5r+1. \tag{5}

Since C(z,0)=zC(z,0)=z, there is a unique formal series R(q)∈1+qQ[[q]]R(q)\in1+q\mathbb Q[[q]] satisfying

C(R(q),q)=1.C(R(q),q)=1.

Fix KK and work modulo qK+1q^{K+1}. Formal division at this root gives

1−C(z,q)=(1−zR(q))HK(z,q),HK(z,0)=1,1-C(z,q)=\left(1-\frac z{R(q)}\right)H_K(z,q), \qquad H_K(z,0)=1,

with deg⁡z[qj]HK−1≤5j\deg_z[q^j]H_K^{-1}\le5j. Therefore, for n≥5Kn\ge5K, equation (1) yields

Pn(q)≡R(q)−(n+1)∂zC(R(q),q)(modqK+1).P_n(q) \equiv \frac{R(q)^{-(n+1)}}{\partial_z C(R(q),q)} \pmod{q^{K+1}}.

Taking formal logarithms and setting K=rK=r proves the explicit all-order formula

κr(n)=−r!((n+1)[qr]log⁡R(q)+[qr]log⁡∂zC(R(q),q)),n≥5r.\boxed{\displaystyle \kappa_r(n) = -r!\left( (n+1)[q^r]\log R(q) +[q^r]\log \partial_zC(R(q),q) \right), \qquad n\ge5r. }

Its right-hand side is affine in nn, proving Conjecture 4.5 at every order.

As additional consequences, ar(n)a_r(n) is eventually a degree-rr polynomial, and r!ar(n)∈Z[n]r!a_r(n)\in\mathbb Z[n]. Indeed source Proposition 3.5 gives

c1(z)=z2+3z3+z4,c1(1)=5,R′(0)=−5,c_1(z)=z^2+3z^3+z^4, \qquad c_1(1)=5, \qquad R'(0)=-5,

so

ar(n)=5rr!nr+O(nr−1).a_r(n)=\frac{5^r}{r!}n^r+O(n^{r-1}).

These consequences establish the general eventual-polynomiality and leading-coefficient assertions. No claim is made here about the four separate sharper onset formulas in Conjecture 4.2.

Source: Blitvić and Petrov, Colored interlacing triangles and Genocchi medians, Conjecture 4.5, https://arxiv.org/abs/2602.04390.