Fighting fish and two-stack sortable permutations
From MaRDI portal
Publication:2632714
zbMath1411.05014arXiv1711.05713MaRDI QIDQ2632714
Publication date: 15 May 2019
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.05713
Related Items
Stack-sorting for Coxeter groups, Lattice paths and \((n - 2)\)-stack sortable permutations, Polyurethane toggles, A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate, Bijections between fighting fish, planar maps, and Tamari intervals, Stack-sorting preimages of permutation classes, A bijection between Tamari intervals and extended fighting fish, Enumeration of Stack-Sorting Preimages via a Decomposition Lemma, Fertility, Strong Fertility, and Postorder Wilf Equivalence, Further bijections to pattern-avoiding valid hook configurations, Counting 3-stack-sortable permutations, Stack-sorting for Words, Troupes, cumulants, and stack-sorting
Cites Work
- Unnamed Item
- Sorting twice through a stack
- 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 bijective census of nonseparable planar maps
- Multi-static enumeration of two-stack sortable permutations
- Left ternary trees and non-separable rooted planar maps
- A combinatorial proof of J. West's conjecture
- A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals
- Fighting fish: enumerative properties
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Fighting fish
- A Census of Planar Maps
- Enumeration of Non-Separable Planar Maps
- On the Enumeration of Rooted Non-Separable Planar Maps
- The enumeration of generalized Tamari intervals
- The enumeration of generalized Tamari intervals
