Dynamics of Pop-Tsack Torsing
Anqi Li

TL;DR
This paper studies a generalized pop-tsack torsing operation on Coxeter groups, resolving conjectures about element enumeration with near maximal orbits and classifying such elements across types A, B, and D.
Contribution
It proves all conjectures on enumeration of elements with near maximal orbits and classifies these elements in Coxeter groups of types A, B, and D.
Findings
Resolved all conjectures on enumeration of near maximal orbit elements.
Provided complete classifications of these elements in types A, B, and D.
Connected orbit lengths to Coxeter group properties.
Abstract
For a finite irreducible Coxeter group with a fixed Coxeter element and set of reflections , Defant and Williams define a pop-tsack torsing operation given by where is the join of all reflections lying below in the absolute order in the non-crossing partition lattice . This is a "dual" notion of the pop-stack sorting operator introduced by Defant as a way to generalize the pop-stack sorting operator on to general Coxeter groups. Define the forward orbit of an element to be . Defant and Williams established the length of the longest possible forward orbits for Coxeter groups…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Algebraic structures and combinatorial models
