Stack-sorting for Coxeter groups
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3955215 (Why is no real title available?)
- scientific article; zbMATH DE number 3722110 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 7524066 (Why is no real title available?)
- 2N noncollinear points determine at least 2N directions
- A Cambrian framework for the oriented cycle
- 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)\)!)
- A survey of stack-sorting disciplines
- Algebraic and combinatorial structures on pairs of twin binary trees
- Brick polytopes, lattice quotients, and Hopf algebras
- Cambrian Hopf algebras
- Cambrian frameworks for cluster algebras of affine type
- Cambrian lattices.
- Catalan and Schröder permutations sortable by two restricted stacks
- Catalan intervals and uniquely sorted permutations
- Combinatorial frameworks for cluster algebras
- Combinatorial generation via permutation languages. II. Lattice congruences
- Combinatorics of Coxeter Groups
- Combinatorics of permutations
- Counting 3-stack-sortable permutations
- Counting Pop-Stacked Permutations in Polynomial Time
- Describing West-3-stack-sortable permutations with permutation patterns
- Enumerating pattern avoidance for affine permutations
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Fertility monotonicity and average complexity of the stack-sorting map
- Fighting fish and two-stack sortable permutations
- Finite Coxeter groups and the weak order
- Hopf algebra of the planar binary trees
- Lattice congruences of the weak order.
- Lattice congruences, fans and Hopf algebras.
- Lattice paths and pattern-avoiding uniquely sorted permutations
- Noncrossing arc diagrams and canonical join representations
- On linear transformations preserving the Pólya frequency property
- Permutrees
- Polyurethane toggles
- Pop-stack-sorting for Coxeter groups
- Postorder Preimages
- Quotientopes
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Realization of the Stasheff polytope
- Removahedral congruences versus permutree congruences
- Restricted stacks as functions
- Revstack sort, zigzag patterns, descent polynomials of t-revstack sortable permutations, and Steingrímsson's sorting conjecture
- Sortable elements and Cambrian lattices.
- Sortable elements for quivers with cycles.
- Sortable elements in infinite Coxeter groups.
- Sorting Cayley permutations with pattern-avoiding machines
- Sorting with pattern-avoiding stacks: the 132-machine
- Stack sorting with restricted stacks
- Stack-sorting with consecutive-pattern-avoiding stacks
- Stack-sorting, set partitions, and Lassalle's sequence
- The Hopf algebra of diagonal rectangulations.
- The On-Line Encyclopedia of Integer Sequences
- The algebra of binary search trees
- Troupes, cumulants, and stack-sorting
- Two-stack-sorting with pop stacks
- Unimodality of a refinement of Lassalle's sequence
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
Cited in
(10)- The image of the pop operator on various lattices
- A lift of West's stack-sorting map to partition diagrams
- Pop-stack-sorting for Coxeter groups
- Foot-sorting for socks
- Troupes, cumulants, and stack-sorting
- Meeting covered elements in -Tamari lattices
- Stack-Sorting for Coxeter Groups
- Deterministic stack-sorting for set partitions
- The order of the (123, 132)-avoiding stack sort
- Dynamics of pop-tsack torsing
This page was built for publication: Stack-sorting for Coxeter groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5052175)
