Geometric CombinatoricsEzra Miller, Victor Reiner, Bernd Sturmfels Geometric combinatorics describes a wide area of mathematics that is primarily the study of geometric objects and their combinatorial structure. This text is a compilation of expository articles at the interface between combinatorics and geometry. |
Contents
XLIII | 285 |
XLIV | 295 |
XLV | 305 |
XLVI | 311 |
XLVII | 317 |
XLVIII | 319 |
XLIX | 327 |
L | 343 |
XII | 53 |
XIII | 61 |
XIV | 63 |
XV | 65 |
XVI | 67 |
XVII | 77 |
XVIII | 87 |
XIX | 101 |
XX | 115 |
XXI | 129 |
XXII | 133 |
XXIII | 135 |
XXIV | 137 |
XXV | 153 |
XXVI | 169 |
XXVII | 181 |
XXVIII | 189 |
XXIX | 201 |
XXX | 207 |
XXXI | 209 |
XXXII | 211 |
XXXIII | 217 |
XXXIV | 227 |
XXXV | 235 |
XXXVI | 241 |
XXXVII | 247 |
XXXVIII | 249 |
XXXIX | 251 |
XL | 253 |
XLI | 261 |
XLII | 277 |
Common terms and phrases
1-skeleton 4-polytopes associahedron Betti numbers Björner cluster algebra cochain complex Cohen-Macaulay cohomology combinatorial compute cone conjecture connected construction convex Corollary corresponding Coxeter group CW complex decomposition defined Definition denote diagonal diagram dimension discrete Morse theory dual edge element example Exercise f-vector face facets Figure formula geometric lattice given gradient vector field graph G graph homomorphisms Hence homology homotopy type hyperplane arrangement induced inequalities intersection isomorphic labeling Lecture Lemma linear manifold Math matrix matroid maximal chains Möbius function modular Morse function Morse theory obtained pair partition lattice permutation polyhedra polyhedron polynomial polytope poset proof Proposition Prove rational reflection group representation result root systems Section sequence shellable Show simplex simplicial complex spheres subgraph subset subspace supersolvable symmetric functions symmetric group Theorem topological torus triangulation V₁ vector field vector space vertices Wachs