Lattice paths and \((n - 2)\)-stack sortable permutations

DOI10.1016/j.jcta.2022.105622zbMath1491.05007OpenAlexW4225917689MaRDI QIDQ2672927

Larry X. W. Wang, Cindy C. Y. Gu

Publication date: 13 June 2022

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2022.105622

zbMATH Keywords

simplicial complexlattice pathlog-concave\((n - 2)\)-stack sortable permutations

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Interlacing log-concavity of the Boros-Moll polynomials
• Sorting twice through a stack
• Describing West-3-stack-sortable permutations with permutation patterns
• Interlacing log-concavity of the derangement polynomials and the Eulerian polynomials
• Stack-sorting, set partitions, and Lassalle's sequence
• On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations
• 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
• On the Neggers-Stanley conjecture and the Eulerian polynomials
• A survey of stack-sorting disciplines
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• Symmetry and unimodality in \(t\)-stack sortable permutations
• A combinatorial proof of the log-concavity of a famous sequence counting permutations
• A simplicial complex of 2-stack sortable permutations
• Combinatorial proof of the log-concavity of the sequence of matching numbers
• Permutations with forbidden subsequences and nonseparable planar maps
• Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
• Troupes, cumulants, and stack-sorting
• Two first-order logics of permutations
• Counting 3-stack-sortable permutations
• Preimages under the stack-sorting algorithm
• Fighting fish and two-stack sortable permutations
• Fighting fish
• Postorder Preimages
• On linear transformations preserving the Pólya frequency property

This page was built for publication: Lattice paths and \((n - 2)\)-stack sortable permutations