Armstrong's characteristic-polynomial conjecture for the Tesler poset

About 9 years old · traced to

Let UnU_n be the set of n×nn\times n upper-triangular matrices with non-negative integer entries. For A=(ai,j)∈UnA=(a_{i,j})\in U_n, define its hook sums by

hk:=(ak,k+ak,k+1+⋯+ak,n)−(a1,k+a2,k+⋯+ak−1,k).h_k:=\left(a_{k,k}+a_{k,k+1}+\cdots+a_{k,n}\right)-\left(a_{1,k}+a_{2,k}+\cdots+a_{k-1,k}\right).

Let T(1n)\mathcal{T}(1^n) be the set of matrices whose hook sums are all 11, and let P(1n)P(1^n) be the Tesler poset on this set. Its characteristic polynomial is

χ(P(1n);q)=∑A∈P(1n)μ(0^,A)qρ(P(1n))−ρ(A).\chi(P(1^n);q)=\sum_{A\in P(1^n)}\mu(\hat{0},A)q^{\rho(P(1^n))-\rho(A)}.

Armstrong's conjecture. The characteristic polynomial satisfies

χ(P(1n);q)=(q−1)(n2).\chi(P(1^n);q)=(q-1)^{\binom{n}{2}}.

This conjecture concerns the enumerative structure of the Tesler poset and was attributed to Drew Armstrong. The supplied text does not state whether it has been resolved.

References

Primary source

Jason O'Neill, “On the poset and asymptotics of Tesler Matrices”, arXiv:1702.00866 (2017).

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.