Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"face poset"”.
-
Decompositions of Simplicial Complexes
… imply the existence of decompositions of the face poset. In Chapter 2, we present a counterexample to Stanley's partitionability conjecture, we give a characterization of the h-vectors of Cohen-Macaulay relative complexes, and we construct a family of disconnected partitionable complexes. In …
-
On Flow Polytopes, nu-Associahedra, and the Subdivision Algebra
… ν-associahedron are obtained by describing its face poset with two ν-Schröder objects. The ν-associahedron is then shown to be dual to a framed triangulation of Fcar(ν), which is a geometric realization of the ν-Tamari complex. The dual graph of this triangulation is the Hasse diagram of the …
-
The Partition Lattice in Many Guises
… known as the alpha-colored permutahedron, whose face poset is Q_n^\alpha. Connections between the Eulerian polynomials and Stirling numbers of the second kind are developed via the fibers of a map from Q_n^{\alpha} to the symmetric group on n-elements
-
Homological Properties of Structures in Commutative Algebra and Algebraic Combinatorics
… explore their connection with order complexes of posets, in particular the face poset of a simplicial complex, and we prove that the depth and h-vector of the Stanley-Reisner ring of a simplicial complex can be computed in a nice way from the reduced homologies of these higher nerve complexes. We …
-
Lattice minors and Eulerian posets
… ordering on pairings called the uncrossing poset, which first appeared in the literature in connection with a certain stratified space of planar electrical networks. We begin by examining some of the relationships between the uncrossing poset and Catalan combinatorics, and then proceed to …
-
Faces of Polytopes
The first two chapters of this thesis are about face numbers of polytopes. In Chapter 1, we settle a question of B\'ar\'any from the 1990s: do all convex $d$-polytopes satisfy $f_0, \ldots, f_{d-1} \geq \min\{f_0,f_{d-1}\}$? We answer ``yes" and prove a stronger statement: for all convex …