A simplicial complex of 2-stack sortable permutations

DOI10.1016/S0196-8858(02)00021-0zbMath1014.05001OpenAlexW2063827947MaRDI QIDQ1867009

Miklós Bóna

Publication date: 2 April 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-8858(02)00021-0

zbMATH Keywords

simplicial complexHilbert serieslabeled treestack-sortable permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)

Related Items

Sorting with networks of data structures ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ Polyurethane toggles ⋮ Stack-sorting preimages of permutation classes ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Counting 3-stack-sortable permutations ⋮ Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets ⋮ Troupes, cumulants, and stack-sorting

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