ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For w∈Snw\in S_n, write

θw=1+∑udu pu(w),\theta_w=1+\sum_u d_u\,p_u(w),

where θw\theta_w is the number of supports of Sw(x)\mathfrak{S}_w(x) and pu(w)p_u(w) counts occurrences of the permutation pattern uu in ww. The coefficients are computed recursively by

du=θu−1−∑σ∈Sℓℓ<mdσ pσ(u),d_u=\theta_u-1-\sum_{\sigma\in S_\ell\atop \ell<m}d_\sigma\,p_\sigma(u),

with the same stability property du=0d_u=0 when the final entry of u∈Smu\in S_m is mm. Support-coefficient positivity conjecture. For any permutation uu, du∈Z≥0d_u\in\mathbb{Z}_{\geq 0}. This is presented as an analogue of Gao's conjecture; no general resolution is given.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.