← All problems

Strong tableau lower bound for q-chromatic coefficients

1 year old · traced to

Let PP be a natural unit interval order with nn elements, let λ⊢n\lambda\vdash n, and let strongST⁡P(λ)\operatorname{strongST}_P(\lambda) be the set of strong standard PP-tableaux of shape λ\lambda. Let inv⁡P(T)\operatorname{inv}_P(T) denote the tableau inversion statistic. Strong tableau q-undercount conjecture. The polynomial

cλP(q)−∑T∈strongST⁡P(λ)qinv⁡P(T)c_\lambda^P(q)-\sum_{T\in\operatorname{strongST}_P(\lambda)}q^{\operatorname{inv}_P(T)}

has non-negative integer coefficients. This conjecture provides a proposed combinatorial lower bound for the qq-elementary coefficient; the source reports verification for natural unit interval orders with at most 1010 elements.

References
  1. Isaiah Siegl, “Toward Lower Bounds for Chromatic Symmetric Functions in the Elementary Basis”, arXiv:2509.02841 (2026).

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.