Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dynamics of Pop-Tsack Torsing

Published 23 Sep 2022 in math.CO | (2209.11548v1)

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 $\mathrm{Popt}\colon W \to W$ given by $\mathrm{Popt}(w) = w \cdot \pi_T(w){-1}$ where $\pi_T(w) = \bigvee_{t \leq_{T}w, \ t \in T}{NC(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 $\mathrm{Pops}$ introduced by Defant as a way to generalize the pop-stack sorting operator on $\mathfrak{S}n$ to general Coxeter groups. Define the forward orbit of an element $w \in W$ to be $O{\mathrm{Popt}}(w) = {w, \mathrm{Popt}(w), \mathrm{Popt}2(w), \ldots }$. Defant and Williams established the length of the longest possible forward orbits $\max_{w \in W}|O_{\mathrm{Popt}}(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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.