The top Gallai-polynomial conjecture via second-order Eulerian numbers

For n>1n>1, let Qn,n1(q)Q_{n,n-1}(q) be the coefficient appearing in the conjectured Hilbert-series expansion of the Gallai algebra Gn,k\mathcal G_{n,k}. Let E(n1,j)E(n-1,j) denote the second-order Eulerian number, counting Stirling permutations of order n1n-1 with jj descents. Top Gallai-polynomial conjecture. For every n>1n>1,

Qn,n1(q)=q(n2)1j=0n1E(n1,j)qj.Q_{n,n-1}(q)=q^{\binom{n}{2}-1}\sum_{j=0}^{n-1}E(n-1,j)q^{-j}.

This gives an explicit formula for the highest-index coefficient in the Gallai Hilbert-series expansion; the source provides no resolution beyond the conjectural statement.

Sources & referencesView supporting material

Primary source

R. M. Adin, A. Berenstein, J. Greenstein, J. -R. Li, A. Marmor and Y. Roichman, “Transitive and Gallai colorings”, arXiv:2309.11203 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.