ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ=(λ1,…,λk)⊢n\lambda=(\lambda_1,\ldots,\lambda_k)\vdash n, let g(λ)=gcd⁡(λ1,…,λk)g(\lambda)=\gcd(\lambda_1,\ldots,\lambda_k), and let Ak−1(t)A_{k-1}(t) and [λi]t[\lambda_i]_t have the meanings defined in the paper. For a polynomial F(t)F(t) and positive integer mm, let F(t)mF(t)_m be obtained by retaining only terms aitia_it^i with gcd⁡(m,i)=1\gcd(m,i)=1. Define

Gλ(t)=(tAk−1(t)∏i=1k[λi]t)g(λ).G_\lambda(t)=\left(tA_{k-1}(t)\prod_{i=1}^k[\lambda_i]_t\right)_{g(\lambda)}.

Power-sum character formula conjecture. The Eulerian quasisymmetric functions satisfy

∑j=0n−1Q(n),jtj=∑λ⊢nzλ−1Gλ(t)pλ.\sum_{j=0}^{n-1}Q_{(n),j}t^j=\sum_{\lambda\vdash n}z_\lambda^{-1}G_\lambda(t)p_\lambda.

Equivalently, the character of V(n),jV_{(n),j} evaluated on the conjugacy class λ\lambda is the coefficient of tjt^j in Gλ(t)G_\lambda(t). The source says this conjecture was proved by Sagan, Shareshian and Wachs and had been verified there through n=8n=8.

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.