Lattice Polynomials and Polytopes

dc.creator	Jacob Farinholt
dc.date.accessioned	2022-01-25T19:21:54Z
dc.date.available	2022-01-25T19:21:54Z
dc.date.issued	2020
dc.description.abstract	A polyhedron, expressed in its canonical form as the intersection of half-spaces, is implicitly defined with respect to a particular ``component-wise'' partial order. This partial order on $\mbb{R}^n$ is a distributive lattice. While a polyhedron with this partial order may not be a sublattice of $\mbb{R}^n$, it may still nevertheless retain some of its lattice structure. This thesis characterizes and classifies polyhedra in $\mbb{R}^n$ according to how much lattice structure is retained. This is done by investigating their closure under convex clones of lattice polynomials. In addition, we investigate the join irreducibles of join semilattice polytopes, and show that they necessarily form faces of the polytope. We then characterize various attributes of these ``join irreducible faces.''
dc.identifier.uri	https://hdl.handle.net/1920/12477
dc.title	Lattice Polynomials and Polytopes
thesis.degree.discipline	Mathematics
thesis.degree.grantor	George Mason University
thesis.degree.level	Ph.D.

Files

Now showing 1 - 1 of 1