<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:10:04Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9105" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9105</identifier><datestamp>2017-03-21T18:49:21Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="c3dc7561-8a6e-4ce6-b39d-bd5ca84ac293" confidence="600">Tam, Ricci Yik Chi</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-01-20T18:12:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-01-20T18:12:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-01-20</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015-01-16</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9105</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Ehrhart theory studies the behaviour of lattice points contained in dilates of lattice polytopes. We provide an introduction to Ehrhart theory. In particular, we prove Ehrhart&amp;apos;s Theorem, Stanley Non-negativity, and Ehrhart-Macdonald Reciprocity via lattice triangulations. We also introduce the algebra $\mathscr{P}(\mathbb{R}^d)$ spanned by indicator functions of polyhedra, and valuations (linear functions) on $\mathscr{P}(\mathbb{R}^d)$. Through this, we derive Brion&amp;apos;s Theorem, which gives an alternate proof of Ehrhart&amp;apos;s Theorem. The proof of Brion&amp;apos;s Theorem makes use of decomposing the lattice polytope in $\mathscr{P}(\mathbb{R}^d)$ into support cones and other polyhedra. More generally, Betke and Kneser proved that every lattice polytope in $\mathscr{P}(\mathbb{R}^d)$ (or the sub-algebra $\mathscr{P}(\mathbb{Z}^d)$, spanned by lattice polytopes) admits a unimodular decomposition; it can be expressed as a formal sum of unimodular simplices. We give a new streamlined proof of this result, as well as some applications and consequences.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Polyhedra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Ehrhart Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Polytope Decomposition</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Valuations</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Polytope Algebra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Polyhedral Subdivision</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Lattice Polytopes</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Ehrhart Theory and Unimodular Decompositions of Lattice Polytopes</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>