ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1 and let σ∈Sn+1\sigma\in\mathfrak{S}_{n+1}. Let R∙(σ)R_{\bullet}(\sigma) denote the set of one-element commutation classes of reduced words of σ\sigma. The possible-cardinalities conjecture. For all σ∈Sn+1\sigma\in\mathfrak{S}_{n+1},

∣R∙(σ)∣∈{0,1,2,4}.|R_{\bullet}(\sigma)|\in\{0,1,2,4\}.

Theorem 7.1 gives the upper bound ∣R∙(σ)∣≤4|R_{\bullet}(\sigma)|\leq 4, while computation through n=8n=8 found no example with exactly three one-element commutation classes. The conjecture asserts that three never occurs; the source does not report a proof or disproof.

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.