The Combinatorics of Lattice Polytopes

We first study the nearly Gorensteinness of Ehrhart rings arising from lattice polytopes. We give necessary conditions and sufficient conditions on lattice polytopes for their Ehrhart rings to be nearly Gorenstein. Using this, we give an efficient method for constructing nearly Gorenstein polytopes....

Full description

Bibliographic Details
Main Author: Hall, Thomas
Format: Thesis (University of Nottingham only)
Language:English
Published: 2024
Subjects:
Online Access:https://eprints.nottingham.ac.uk/78507/
_version_ 1848801086184357888
author Hall, Thomas
author_facet Hall, Thomas
author_sort Hall, Thomas
building Nottingham Research Data Repository
collection Online Access
description We first study the nearly Gorensteinness of Ehrhart rings arising from lattice polytopes. We give necessary conditions and sufficient conditions on lattice polytopes for their Ehrhart rings to be nearly Gorenstein. Using this, we give an efficient method for constructing nearly Gorenstein polytopes. Moreover, we determine the structure of nearly Gorenstein 0/1-polytopes. Next, we introduce a new constant associated to a Fano polygon, called the PCR index, and prove that it is invariant under mutation. We obtain a convenient formula for the PCR index in terms of the lengths and heights of the edges of the polygon and apply this to show that two given Fano polygons with the same singularity content are not mutation-equivalent. Finally, we give an alternative way to classify the minimal Fano triangles which have empty basket of singularities; we accomplish this using Markov-like Diophantine equations. Then, we study a subclass of Kähler-Einstein Fano polygons and how they behave under mutation. The polygons of interest are Kähler-Einstein Fano triangles and symmetric Fano polygons, which were recently conjectured to constitute all Kähler-Einstein Fano polygons. We show that all polygons in this subclass are minimal and that each mutation-equivalence class has at most one Fano polygon belonging to this subclass. Finally, we provide counterexamples to the aforementioned conjecture and discuss several of their properties. Finally, we study generalised flatness constants of lattice polytopes.
first_indexed 2025-11-14T21:01:51Z
format Thesis (University of Nottingham only)
id nottingham-78507
institution University of Nottingham Malaysia Campus
institution_category Local University
language English
last_indexed 2025-11-14T21:01:51Z
publishDate 2024
recordtype eprints
repository_type Digital Repository
spelling nottingham-785072024-12-13T04:40:04Z https://eprints.nottingham.ac.uk/78507/ The Combinatorics of Lattice Polytopes Hall, Thomas We first study the nearly Gorensteinness of Ehrhart rings arising from lattice polytopes. We give necessary conditions and sufficient conditions on lattice polytopes for their Ehrhart rings to be nearly Gorenstein. Using this, we give an efficient method for constructing nearly Gorenstein polytopes. Moreover, we determine the structure of nearly Gorenstein 0/1-polytopes. Next, we introduce a new constant associated to a Fano polygon, called the PCR index, and prove that it is invariant under mutation. We obtain a convenient formula for the PCR index in terms of the lengths and heights of the edges of the polygon and apply this to show that two given Fano polygons with the same singularity content are not mutation-equivalent. Finally, we give an alternative way to classify the minimal Fano triangles which have empty basket of singularities; we accomplish this using Markov-like Diophantine equations. Then, we study a subclass of Kähler-Einstein Fano polygons and how they behave under mutation. The polygons of interest are Kähler-Einstein Fano triangles and symmetric Fano polygons, which were recently conjectured to constitute all Kähler-Einstein Fano polygons. We show that all polygons in this subclass are minimal and that each mutation-equivalence class has at most one Fano polygon belonging to this subclass. Finally, we provide counterexamples to the aforementioned conjecture and discuss several of their properties. Finally, we study generalised flatness constants of lattice polytopes. 2024-12-13 Thesis (University of Nottingham only) NonPeerReviewed application/pdf en cc_by https://eprints.nottingham.ac.uk/78507/1/Hall%2C%20Thomas%2C%2014250789%2C%20final.pdf Hall, Thomas (2024) The Combinatorics of Lattice Polytopes. PhD thesis, University of Nottingham. polytopes combinatorics mirror symmetry gorenstein lattices convex geometry
spellingShingle polytopes
combinatorics
mirror symmetry
gorenstein
lattices
convex geometry
Hall, Thomas
The Combinatorics of Lattice Polytopes
title The Combinatorics of Lattice Polytopes
title_full The Combinatorics of Lattice Polytopes
title_fullStr The Combinatorics of Lattice Polytopes
title_full_unstemmed The Combinatorics of Lattice Polytopes
title_short The Combinatorics of Lattice Polytopes
title_sort combinatorics of lattice polytopes
topic polytopes
combinatorics
mirror symmetry
gorenstein
lattices
convex geometry
url https://eprints.nottingham.ac.uk/78507/