Search arXivSearch

arXiv · 2209.11548

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 $\mathrm{Popt}\colon W \to W$ given by $\mathrm{Popt}(w) = w \cdot π_T(w)^{-1}$ where $π_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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anqi Li. 2022-09-23. Dynamics of Pop-Tsack Torsing. https://arxiv.org/abs/2209.11548

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO