Physical Sciences and Mathematics Commons^™

Lattice Simplices: Sufficiently Complicated, Brian Davis

Theses and Dissertations--Mathematics

Simplices are the "simplest" examples of polytopes, and yet they exhibit much of the rich and subtle combinatorics and commutative algebra of their more general cousins. In this way they are sufficiently complicated --- insights gained from their study can inform broader research in Ehrhart theory and associated fields.

In this dissertation we consider two previously unstudied properties of lattice simplices; one algebraic and one combinatorial. The first is the Poincar\'e series of the associated semigroup algebra, which is substantially more complicated than the Hilbert series of that same algebra. The second is the partial ordering of the elements of …

Flag F-Vectors Of Polytopes With Few Vertices, Sarah A. Nelson

Theses and Dissertations--Mathematics

We may describe a polytope P as the convex hull of n points in space. Here we consider the numbers of chains of faces of P. The toric g-vector and CD-index of P are useful invariants for encoding this information. For a simplicial polytope P, Lee defined the winding number w_k in a Gale diagram corresponding to P. He showed that w_k in the Gale diagram equals g_k of the corresponding polytope. In this dissertation, we fully establish how to compute the g-vector for any polytope with few vertices from its …

Deletion-Induced Triangulations, Clifford T. Taylor

Theses and Dissertations--Mathematics

Let d > 0 be a fixed integer and let A ⊆ ℝ^d be a collection of n ≥ d + 2 points which we lift into ℝ^d+1. Further let k be an integer satisfying 0 ≤ k ≤ n-(d+2) and assign to each k-subset of the points of A a (regular) triangulation obtained by deleting the specified k-subset and projecting down the lower hull of the convex hull of the resulting lifting. Next, for each triangulation we form the characteristic vector defined by Gelfand, Kapranov, and Zelevinsky by assigning to each …

Boij-Söderberg Decompositions, Cellular Resolutions, And Polytopes, Stephen Sturgeon

Theses and Dissertations--Mathematics

Boij-Söderberg theory shows that the Betti table of a graded module can be written as a linear combination of pure diagrams with integer coefficients. In chapter 2 using Ferrers hypergraphs and simplicial polytopes, we provide interpretations of these coefficients for ideals with a d-linear resolution, their quotient rings, and for Gorenstein rings whose resolution has essentially at most two linear strands. We also establish a structural result on the decomposition in the case of quasi-Gorenstein modules. These results are published in the Journal of Algebra, see [25].

In chapter 3 we provide some further results about Boij-Söderberg decompositions. We …

General Flips And The Cd-Index, Daniel J. Wells

University of Kentucky Doctoral Dissertations

We generalize bistellar operations (often called flips) on simplicial manifolds to a notion of general flips on PL-spheres. We provide methods for computing the cd-index of these general flips, which is the change in the cd-index of any sphere to which the flip is applied. We provide formulas and relations among flips in certain classes, paying special attention to the classic case of bistellar flips. We also consider questions of "flip-connecticity", that is, we show that any two polytopes in certain classes can be connected via a sequence of flips in an appropriate class.