Stack-sorting for Coxeter groups
From MaRDI portal
Publication:5052175
DOI10.5070/C62156890MaRDI QIDQ5052175
Publication date: 21 November 2022
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.03215
Permutations, words, matrices (05A05) Lattice ideals, congruence relations (06B10) Combinatorial dynamics (types of periodic orbits) (37E15) Semilattices (06A12) Combinatorial aspects of groups and algebras (05E16)
Related Items (4)
Pop-stack-sorting for Coxeter groups ⋮ The image of the pop operator on various lattices ⋮ A lift of West's stack-sorting map to partition diagrams ⋮ Meeting covered elements in \(\nu\)-Tamari lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Lattice congruences, fans and Hopf algebras.
- The algebra of binary search trees
- The Hopf algebra of diagonal rectangulations.
- Describing West-3-stack-sortable permutations with permutation patterns
- Stack-sorting, set partitions, and Lassalle's sequence
- A Cambrian framework for the oriented cycle
- Sortable elements for quivers with cycles.
- Sortable elements and Cambrian lattices.
- 2N noncollinear points determine at least 2N directions
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
- Hopf algebra of the planar binary trees
- A survey of stack-sorting disciplines
- Brick polytopes, lattice quotients, and Hopf algebras
- Algebraic and combinatorial structures on pairs of twin binary trees
- Realization of the Stasheff polytope
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Enumerating pattern avoidance for affine permutations
- Restricted stacks as functions
- Catalan and Schröder permutations sortable by two restricted stacks
- Stack-sorting with consecutive-pattern-avoiding stacks
- Combinatorial generation via permutation languages. II. Lattice congruences
- The On-Line Encyclopedia of Integer Sequences
- Catalan intervals and uniquely sorted permutations
- Polyurethane toggles
- Sorting with pattern-avoiding stacks: the \(132\)-machine
- Fertility monotonicity and average complexity of the stack-sorting map
- Removahedral congruences versus permutree congruences
- Counting 3-stack-sortable permutations
- Stack sorting with restricted stacks
- Cambrian Hopf algebras
- Cambrian lattices.
- Lattice congruences of the weak order.
- Fighting fish and two-stack sortable permutations
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
- Combinatorics of Permutations
- Postorder Preimages
- Finite Coxeter Groups and the Weak Order
- Combinatorics of Coxeter Groups
- Sortable elements in infinite Coxeter groups
- Cambrian frameworks for cluster algebras of affine type
- Quotientopes
- Sorting Cayley permutations with pattern-avoiding machines
- Pop-stack-sorting for Coxeter groups
- Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
- Two-stack-sorting with pop stacks
- Noncrossing Arc Diagrams and Canonical Join Representations
- On linear transformations preserving the Pólya frequency property
- Combinatorial Frameworks for Cluster Algebras
- Permutrees
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Counting Pop-Stacked Permutations in Polynomial Time
- Unimodality of a refinement of Lassalle's sequence
- Troupes, cumulants, and stack-sorting
This page was built for publication: Stack-sorting for Coxeter groups
