A simplicial complex of 2-stack sortable permutations

DOI10.1016/S0196-8858(02)00021-0zbMATH Open1014.05001OpenAlexW2063827947MaRDI QIDQ1867009FDOQ1867009

Authors: 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

Recommendations

• Stack-sortable permutations and beyond
• Multi-static enumeration of two-stack sortable permutations
• Lattice paths and \((n - 2)\)-stack sortable permutations
• Generalized Stack Permutations
• A survey of stack-sorting disciplines

zbMATH Keywords

simplicial complexHilbert serieslabeled treestack-sortable permutation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A bijective census of nonseparable planar maps
• Hilbert polynomials in combinatorics
• 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)\)!)
• Multi-static enumeration of two-stack sortable permutations
• 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
• On the Neggers-Stanley conjecture and the Eulerian polynomials
• \(h\)-shellings and \(h\)-complexes

Cited In (11)

• Counting 3-stack-sortable permutations
• Sorting with networks of data structures
• Polyurethane toggles
• Permutations with forbidden subsequences and nonseparable planar maps
• Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
• Lattice paths and \((n - 2)\)-stack sortable permutations
• Stack-sorting preimages of permutation classes
• Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets
• Troupes, cumulants, and stack-sorting

This page was built for publication: A simplicial complex of 2-stack sortable permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867009)