1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2021
Coxeter Pop-Tsack Torsing
Colin Defant, Nathan Williams
Given a finite irreducible Coxeter group with a fixed Coxeter element , we define the Coxeter pop-tsack torsing operator by $\mathsf{Pop}_T(w)=w\cdot…
math.CO2021
Pop-Stack-Sorting for Coxeter Groups
Colin Defant
Let be an irreducible Coxeter group. We define the Coxeter pop-stack-sorting operator to be the map that fixes the identity element and sends each noniden…
math.CO2016★ 1 cited
Postorder Preimages
Colin Defant
Given a set of decreasing plane trees and a permutation , how many trees in have as their postorder? Using combinatorial and geometric constructions, we provide a me…