Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Deletion-Induced Triangulations, Clifford T. Taylor Jan 2015

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 nd + 2 points which we lift into ℝd+1. Further let k be an integer satisfying 0 ≤ kn-(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 …


Combinatorial Potpourri: Permutations, Products, Posets, And Pfaffians, Norman B. Fox Jan 2015

Combinatorial Potpourri: Permutations, Products, Posets, And Pfaffians, Norman B. Fox

Theses and Dissertations--Mathematics

In this dissertation we first examine the descent set polynomial, which is defined in terms of the descent set statistics of the symmetric group. Algebraic and topological tools are used to explain why large classes of cyclotomic polynomials are factors of the descent set polynomial. Next the diamond product of two Eulerian posets is studied, particularly by examining the effect this product has on their cd-indices. A combinatorial interpretation involving weighted lattice paths is introduced to describe the outcome of applying the diamond product operator to two cd-monomials. Then the cd-index is defined for infinite posets, with …


Unimodality Questions In Ehrhart Theory, Robert Davis Jan 2015

Unimodality Questions In Ehrhart Theory, Robert Davis

Theses and Dissertations--Mathematics

An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal h*-vector.Although various sufficient conditions have been found, necessary conditions remain a challenge. Highly-structured polytopes, such as the polytope of real doubly-stochastic matrices, have been proven to possess unimodal h*-vectors, but the same is unknown even for small variations of it.

In this dissertation, we mainly consider two particular classes of polytopes: reflexive simplices and the polytope of symmetric real doubly-stochastic matrices. For the first class, we discuss an operation that preserves reflexivity, integral closure, and unimodality of the h* …


Polyhedral Problems In Combinatorial Convex Geometry, Liam Solus Jan 2015

Polyhedral Problems In Combinatorial Convex Geometry, Liam Solus

Theses and Dissertations--Mathematics

In this dissertation, we exhibit two instances of polyhedra in combinatorial convex geometry. The first instance arises in the context of Ehrhart theory, and the polyhedra are the central objects of study. The second instance arises in algebraic statistics, and the polyhedra act as a conduit through which we study a nonpolyhedral problem.

In the first case, we examine combinatorial and algebraic properties of the Ehrhart h*-polynomial of the r-stable (n,k)-hypersimplices. These are a family of polytopes which form a nested chain of subpolytopes within the (n,k)-hypersimplex. We show that a well-studied unimodular triangulation of the (n,k)-hypersimplex restricts to a …