An algorithm for the classification of smooth Fano polytopes
By Mikkel Obro. 2007
77 citations recorded by the source corpus.
We present an algorithm that produces the classification list of smooth Fano d-polytopes for any given d ≥ 1. The input of the algorithm is a single number, namely the positive integer d. The algorithm has been used to classify smooth Fano d-polytopes for d ≤ 7. There are 7622 isomorphism classes of smooth Fano 6-polytopes and 72256 isomorphism classes of smooth Fano 7-polytopes.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/ed886dfcad2d75802afd7d6682b1e56e9e1b46c6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- Lindsay C. Piechnik
- Francisco Santos
- Christian Haase
- Andreas Paffenholz
- M. Develin
- Alexander Postnikov
- Federico Ardila
- Bernd Sturmfels
In Geometry and Topology
Citations in the corpus
- Existence of unimodular triangulations — positive results (2014, methodology): “Øbro [76] has computed explicit representations of all d-dimensional simplicial reflexive polytopes for d ≤ 8 (up to lattice equivalence).”