RUC. Repositorio da Universidade da Coruña
Publication
Artículo científico (JournalArticle)
Classification of empty lattice 4-simplices of width larger than two
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/. This is a preliminary PDF of the author-produced manuscript that has been peer-reviewed and accepted for publication. It has not been copyedited, proofread, or finalized by AMS Production staff. The Version of Record is available online at: https://doi.org/10.1090/tran/7531, [Abstract]: Rd. It is called empty if it contains no lattice point apart of its d + 1 vertices. The classification of empty 3-simplices is known since 1964
(White), based on the fact that they all have width one. But for dimension 4 no complete classification is known. Haase and Ziegler (2000) enumerated all empty 4-simplices up to determinant 1000 and based on their results conjectured that after determinant 179 all empty 4-simplices have width one or two. We prove this conjecture as follows:
- We show that no empty 4-simplex of width three or more can have determinant greater than 5058, by combining the recent classification of hollow
3-polytopes (Averkov, Krümpelmann and Weltge, 2017) with general methods from the geometry of numbers.
- We continue the computations of Haase and Ziegler up to determinant 7600, and find that no new 4-simplices of width larger than two arise.
In particular, we give the whole list of empty 4-simplices of width larger than two, which is as computed by Haase and Ziegler: There is a single empty
4-simplex of width four (of determinant 101), and 178 empty 4-simplices of width three, with determinants ranging from 41 to 179., This work was supported by grants MTM2014-54207-P (both authors) and BES-2015-073128 (first author) of the Spanish Ministry of Economy and Competitiveness. The second author was also supported by an Einstein Visiting Professorship of the Einstein Foundation Berlin.