A simplicial complex of 2-stack sortable permutations
From MaRDI portal
Publication:1867009
DOI10.1016/S0196-8858(02)00021-0zbMath1014.05001MaRDI QIDQ1867009
Publication date: 2 April 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
05C30: Enumeration in graph theory
Related Items
Sorting with networks of data structures, Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets
Cites Work
- Unnamed Item
- 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
- \(h\)-shellings and \(h\)-complexes
- Multi-static enumeration of two-stack sortable permutations
- Hilbert polynomials in combinatorics
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Permutations with forbidden subsequences and nonseparable planar maps
- Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps