ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let {\text{\boldmath p}}=(p_1,\ldots,p_m) and {\text{\boldmath q}}=(q_1,\ldots,q_m) be sequences of positive integers with q1≥⋯≥qmq_1\geq\cdots\geq q_m, and let {\text{\boldmath p}}\times{\text{\boldmath q}} be the partition formed by the union of rectangles of sizes pi×qip_i\times q_i. Let \lambda={\text{\boldmath p}}\times{\text{\boldmath q}}, let μ\mu be a partition with m1(μ)=0m_1(\mu)=0 and ∣μ∣=k≤∣λ∣=n|\mu|=k\leq|\lambda|=n, let β=α−1\beta=\alpha-1, and write μ=(1m1(μ),2m2(μ),…)\mu=(1^{m_1(\mu)},2^{m_2(\mu)},\ldots) and zμ=∏i≥1imi(μ)mi(μ)!z_\mu=\prod_{i\geq1}i^{m_i(\mu)}m_i(\mu)!. The Jack polynomials are expanded as Jλ(α)=∑∣ρ∣=∣λ∣θρλ(α)pρJ_\lambda(\alpha)=\sum_{|\rho|=|\lambda|}\theta^\lambda_\rho(\alpha)p_\rho. Stanley's positivity conjecture. The quantity zμθμ,1n−kλ(α)z_\mu\theta^\lambda_{\mu,1^{n-k}}(\alpha) is a polynomial in ({\text{\boldmath p}},{\text{\boldmath q}},\beta) with integer coefficients; after replacing {\text{\boldmath q}} by -{\text{\boldmath q}}, the coefficients of (−1)kzμθμ,1n−kλ(α)(-1)^kz_\mu\theta^\lambda_{\mu,1^{n-k}}(\alpha) are nonnegative integers, and at least one coefficient is 11. This extends the corresponding positivity theorem for normalized symmetric-group characters and is presented as a conjectured Jack-polynomial analogue; the source gives no resolution of the full multirectangular claim.

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.