Polyurethane toggles
From MaRDI portal
Publication:2188837
DOI10.37236/9097zbMath1441.05007arXiv1904.06283OpenAlexW3037613592MaRDI QIDQ2188837
Publication date: 15 June 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.06283
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Group actions on combinatorial structures (05E18)
Related Items (11)
Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ Catalan intervals and uniquely sorted permutations ⋮ Supertrees ⋮ Fertilitopes ⋮ A lift of West's stack-sorting map to partition diagrams ⋮ Uniquely sorted permutations ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Counting 3-stack-sortable permutations ⋮ Preimages under the bubblesort operator
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
- Promotion and rowmotion
- Patterns in permutations and words.
- Describing West-3-stack-sortable permutations with permutation patterns
- Stack words and a bound for 3-stack sortable permutations
- Stack-sorting, set partitions, and Lassalle's sequence
- Promotion and evacuation
- Permutation statistics and linear extensions of posets
- Dual equivalence with applications, including a conjecture of Proctor
- Evacuation of labelled graphs
- Promotion des morphismes d'ensembles ordonnes
- A survey of stack-sorting disciplines
- A combinatorial proof of J. West's conjecture
- Sorted and/or sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- A simplicial complex of 2-stack sortable permutations
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Catalan intervals and uniquely sorted permutations
- Descents in \(t\)-sorted permutations
- Fertility numbers
- Counting 3-stack-sortable permutations
- The kernel method for lattice paths below a line of rational slope
- Preimages under the stack-sorting algorithm
- Actions on permutations and unimodality of descent polynomials
- Enumeration of plane partitions
- Fighting fish and two-stack sortable permutations
- Classification of bijections between 321- and 132-avoiding permutations
- Combinatorics of Permutations
- Dynamical algebraic combinatorics and the homomesy phenomenon
- Postorder Preimages
- Fertility, Strong Fertility, and Postorder Wilf Equivalence
- Sorting and preimages of pattern classes
- On linear transformations preserving the Pólya frequency property
- Quelques remarques sur une Construction de Schensted.
This page was built for publication: Polyurethane toggles
