Unimodular Smooth Fano Polytopes and their Relation with Ewald Conditions

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Tu, Binnan
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913521690738688
author Tu, Binnan
author_facet Tu, Binnan
contents Smooth Fano polytopes (SFP) play an important role in toric geometry and combinatorics. In this paper, we introduce a specific subcollection of them, i.e., the unimodular smooth Fano polytopes (USFP). In Section 2, they are verified to satisfy the three (weak, strong, star) Ewald conditions. Besides, a characterisation of USFPs is provided as a corollary of the famous Seymour's decomposition theorem. Then, we briefly introduce the works by Luis Crespo on deeply monotone polytopes and give a proof of the claim that any deeply monotone polytope is in fact the dual polytope of some USFP. In other words, we extend his results on deeply monotone polytopes to the case of USFPs.
format Preprint
id arxiv_https___arxiv_org_abs_2409_14678
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Unimodular Smooth Fano Polytopes and their Relation with Ewald Conditions
Tu, Binnan
Combinatorics
Smooth Fano polytopes (SFP) play an important role in toric geometry and combinatorics. In this paper, we introduce a specific subcollection of them, i.e., the unimodular smooth Fano polytopes (USFP). In Section 2, they are verified to satisfy the three (weak, strong, star) Ewald conditions. Besides, a characterisation of USFPs is provided as a corollary of the famous Seymour's decomposition theorem. Then, we briefly introduce the works by Luis Crespo on deeply monotone polytopes and give a proof of the claim that any deeply monotone polytope is in fact the dual polytope of some USFP. In other words, we extend his results on deeply monotone polytopes to the case of USFPs.
title Unimodular Smooth Fano Polytopes and their Relation with Ewald Conditions
topic Combinatorics
url https://arxiv.org/abs/2409.14678