Shelling Coxeter-like complexes and sorting on trees

DOI10.1016/j.aim.2009.01.007zbMath1160.05059arXiv0809.2414OpenAlexW1999315283MaRDI QIDQ1018417

Patricia Hersh

Publication date: 19 May 2009

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

Full work available at URL: https://arxiv.org/abs/0809.2414

zbMATH Keywords

sortingCoxeter complexchessboard complexshellabilityweak ordershellinggreedy sorting algorithmsimplicial complex associated to treesorting on tree

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Combinatorics of partially ordered sets (06A07) Simplicial sets and complexes in algebraic topology (55U10)

Cites Work

• Decompositions and connectivity of matching and chessboard complexes
• Posets, regular CW complexes and Bruhat order
• Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
• f-vectors and h-vectors of simplicial posets
• Torsion in the matching complex and chessboard complex
• The colored Tverberg's problem and complexes of injective functions
• On the Betti numbers of chessboard complexes
• Shellability of chessboard complexes
• Minimal resolutions and the homology of matching and chessboard complexes
• Topology of matching, chessboard, and general bounded degree graph complexes
• Chessboard Complexes and Matching Complexes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item