Unimodality Problems in Ehrhart Theory

Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*$-vectors have connections to many areas of mathematics, including commutative algebra and enumerative combinatorics. In this survey we discuss what is known about unimodality for Ehrhart $h^*$-vectors and highlight open questions and problems.Comment: Published in Recent Trends in Combinatorics, Beveridge, A., et al. (eds), Springer, 2016, pp 687-711, doi 10.1007/978-3-319-24298-9_27. This version updated October 2017 to correct an error in the original versio

Fiber polytopes for the projections between cyclic polytopes

The cyclic polytope $C(n,d)$ is the convex hull of any $n$ points on the moment curve ${(t,t^2,...,t^d):t \in \reals}$ in $\reals^d$. For $d' >d$, we consider the fiber polytope (in the sense of Billera and Sturmfels) associated to the natural projection of cyclic polytopes $\pi: C(n,d') \to C(n,d)$ which "forgets" the last $d'-d$ coordinates. It is known that this fiber polytope has face lattice indexed by the coherent polytopal subdivisions of $C(n,d)$ which are induced by the map $\pi$. Our main result characterizes the triples $(n,d,d')$ for which the fiber polytope is canonical in either of the following two senses: - all polytopal subdivisions induced by $\pi$ are coherent, - the structure of the fiber polytope does not depend upon the choice of points on the moment curve. We also discuss a new instance with a positive answer to the Generalized Baues Problem, namely that of a projection $\pi:P\to Q$ where $Q$ has only regular subdivisions and $P$ has two more vertices than its dimension.Comment: 28 pages with 1 postscript figur

Cutting Sequences and the p-adic Littlewood Conjecture

The main aim of this thesis is to use the geometric setting of cutting sequences to better understand the behaviour of continued fractions under integer multiplication. We will use cutting sequences to construct an algorithm that multiplies continued fractions by an integer $n$. The theoretical aspects of this algorithm allow us to explore the interesting properties of continued fractions under integer multiplication. In particular, we show that an eventually recurrent continued fractions remain eventually recurrent when multiplied by a rational number. Finally, and most importantly, we provide a reformulation the $p$-adic Littlewood Conjecture in terms of a condition on the semi-convergents of a real number $\alpha$

Optimizing the double description method for normal surface enumeration

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an account of the vertex enumeration problem as it applies to normal surfaces, and present new optimizations that yield strong improvements in both running time and memory consumption. The resulting algorithms are tested using the freely available software package Regina.Comment: 27 pages, 12 figures; v2: Removed the 3^n bound from Section 3.3, fixed the projective equation in Lemma 4.4, clarified "most triangulations" in the introduction to section 5; v3: replace -ise with -ize for Mathematics of Computation (note that this changes the title of the paper