Dynamics of Pop-Tsack Torsing

Abstract

For a finite irreducible Coxeter group (W,S) with a fixed Coxeter element c and set of reflections T, Defant and Williams define a pop-tsack torsing operation Popt W W given by Popt(w) = w · πT(w)-1 where πT(w) = t ≤Tw, \ t ∈ TNC(w,c)t is the join of all reflections lying below w in the absolute order in the non-crossing partition lattice NC(w,c). This is a "dual" notion of the pop-stack sorting operator Pops introduced by Defant as a way to generalize the pop-stack sorting operator on Sn to general Coxeter groups. Define the forward orbit of an element w ∈ W to be OPopt(w) = \w, Popt(w), Popt2(w), … \. Defant and Williams established the length of the longest possible forward orbits w ∈ W|OPopt(w)| for Coxeter groups of coincidental types and type D in terms of the corresponding Coxeter number of the group. In their paper, they also proposed multiple conjectures about enumerating elements with near maximal orbit length. We resolve all the conjectures that they have put forth about enumeration, and in the process we give complete classifications of these elements of Coxeter groups of types A,B and D with near maximal orbit lengths.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…