ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, let ∇∗\nabla_\ast be the operator on symmetric functions in two alphabets defined by ∇∗H~μ=H~μ⊗H~μ\nabla_\ast\widetilde H_\mu=\widetilde H_\mu\otimes\widetilde H_\mu, and let RTT0(n)\mathsf{RTT}_0(n) denote the relevant family of rooted tiered trees of size nn. For each TT, write inv(T)\mathsf{inv}(T) for its inversion statistic and α(T),β(T)\alpha(T),\beta(T) for the associated compositions. The symmetric theta conjecture.

∇∗en∣t=1=∑T∈RTT0(n)qinv(T)xα(T)yβ(T).\left.\nabla_\ast e_n\right\rvert_{t=1}=\sum_{T\in\mathsf{RTT}_0(n)}q^{\mathsf{inv}(T)}x^{\alpha(T)}y^{\beta(T)}.

This is the equivalent symmetric-function reformulation obtained by summing the preceding identity over compositions; the supplied text gives no resolution status.

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.