Poset Topology: Tools and Applications
By Michelle L. Wachs. 2006
312 citations recorded by the source corpus.
These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of poset topology. These notes include introductory material, as well as recent developments and open problems. Some of the topics covered are: subspace arrangements, graph complexes, group actions on poset homology, shellability, recursive techniques, and fiber theorems.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/36ef70b42200248aa24da485446882008b7729bf
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Discrete Mathematics and Combinatorics
- John Shareshian
- Michelle L. Wachs
- Jonathan Ariel Barmak
- Megumi Harada
- Bruce E. Sagan
- Sarah K. Mason
- Christos A. Athanasiadis
- M. Masuda
In Mathematical Physics
Citations in the corpus
- Q-Eulerian polynomials: Excedance number and major index (2006, methodology): “a well-known tool from poset topology, called lexicographic shellability [3, 37 ], to prove that”
- Algebraic Topology of Finite Topological Spaces and Applications (2011, background): “In Quillen’s paper [70] and in many other articles ([17, 18, 79, 80] for instance), posets are studied from a topological viewpoint only through their associated simplicial complexes.”
- Eulerian quasisymmetric functions (2008, background): “(See [67] for a discussion of poset homology.”