ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γ\varGamma be a finite Abelian group, and for each n≥1n\geq 1 let Γn~\widetilde{\varGamma^{n}} be the quotient of Γn\varGamma^n by its diagonal subgroup. In the cyclic case, define

Cn(q)=∑αqdim⁡Vα,C_n(q)=\sum_\alpha q^{\dim V_\alpha},

where ⨁αVα\bigoplus_\alpha V_\alpha is the decomposition into irreducibles of Ind⁡SnΓn~⋊Sn(1)\operatorname{Ind}^{\widetilde{\varGamma^{n}} \rtimes S_n}_{S_n}(1). Also, let S(n)S(n) be the set of sequences b=(b1,…,bn)∈Nn\mathbf{b}=(b_1,\dots,b_n)\in\mathbb{N}^n satisfying ∑i=1jbi≥j\sum_{i=1}^j b_i\geq j for j=1,…,nj=1,\dots,n and ∑i=1nbi=n\sum_{i=1}^n b_i=n, and define

Sn(q)=∑b∈S(n)q(nb1,…,bn).S_n(q)=\sum_{\mathbf{b}\in S(n)}q^{\binom{n}{b_1,\ldots,b_n}}.

Equality conjecture. The polynomials Cn(q)C_n(q) and Sn(q)S_n(q) are identical for all n≥1n\geq 1. This would identify the dimension-generating polynomial arising from the multiplicity-free Gelfand-pair representation with the corresponding polynomial over parking-function sequences. The source gives no resolution or further evidence for this equality, so its status remains open.

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.