ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let An−1A_{n-1} be the type AA Coxeter system, let 4frakSn4frak S_n be its permutation group, and let PopT\mathsf{Pop}_T be the Coxeter Pop-Tsack map. A permutation requires exactly kk iterations of PopT\mathsf{Pop}_T to reach the identity if kk is the least nonnegative integer such that PopTk(w)=e\mathsf{Pop}_T^k(w)=e. The type A enumeration conjecture. In type An−1A_{n-1}, the number of permutations that require exactly n−2n-2 or n−1n-1 iterations of PopT\mathsf{Pop}_T to reach the identity is

2n−(n2).2^n-\binom{n}{2}.

This refines the orbit-length analysis of the Coxeter Pop-Tsack map in type AA by enumerating the elements at the two greatest possible distances from the identity. The supplied text does not state whether this enumeration has been proved or 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.