The type A enumeration conjecture for Coxeter Pop-Tsack torsing
Statement
Let be the type Coxeter system, let be its permutation group, and let be the Coxeter Pop-Tsack map. A permutation requires exactly iterations of to reach the identity if is the least nonnegative integer such that . The type A enumeration conjecture. In type , the number of permutations that require exactly or iterations of to reach the identity is
This refines the orbit-length analysis of the Coxeter Pop-Tsack map in type 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.