ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let I,J⊆[n−1]I,J\subseteq [n-1] with I∩J=∅I\cap J=\emptyset. Let i∈Pi\in\mathbb{P} and k∈Nk\in\mathbb{N} satisfy i+2k+2∉I∪Ji+2k+2\notin I\cup J, and suppose that [i,i+2k][i,i+2k] is a connected component of I∪JI\cup J, written as

[i,i+2k]=A∪B,[i,i+2k]=A\cup B,

where A⊆IA\subseteq I and B⊆JB\subseteq J. For the descent-class notation DJI(Sn){\cal D}^{I}_{J}(S_n), let ℓ\ell be Coxeter length and LL the number of odd inversions. Define

I~=(I∖A)∪(A+1),J~=(J∖B)∪(B+1).\widetilde I=(I\setminus A)\cup(A+1),\qquad \widetilde J=(J\setminus B)\cup(B+1).

Shift conjecture. One has

∑σ∈DJI(Sn)(−1)ℓ(σ)xL(σ)=∑σ∈DJ~I~(Sn)(−1)ℓ(σ)xL(σ).\sum_{\sigma\in {\cal D}^{I}_{J}(S_n)}(-1)^{\ell(\sigma)}x^{L(\sigma)} = \sum_{\sigma\in {\cal D}^{\widetilde I}_{\widetilde J}(S_n)}(-1)^{\ell(\sigma)}x^{L(\sigma)}.

This conjecture extends the previously proved shifting identities by allowing the connected component to contain elements of both II and JJ. The supplied text gives no resolution evidence, 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.