Structure and Classifications of Lattice Polytopes
Structure and Classifications of Lattice Polytopes Andreas Paffenholz Technische Universität Darmstadt (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . I Why? . experimentation . obtain/test conjectures August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . I Why? . experimentation . obtain/test conjectures I How? . computational . enumerate complete subfamilies . PALP, polymake . Graded Rings Database, polymake database polyDB August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . I Why? . experimentation . obtain/test conjectures I How? .
[Show full text]