Polytopes.Lattice.SmoothReflexive (Q161344): Difference between revisions
From MaRDI portal
Created claim: full work available at URL (P205): https://db.polymake.org/#collection=Polytopes.Lattice.SmoothReflexive |
Removed claim: official website (P29): https://db.polymake.org/#collection=Polytopes.Lattice.SmoothReflexive |
||
| Property / official website | |||
| Property / official website: https://db.polymake.org/#collection=Polytopes.Lattice.SmoothReflexive / rank | |||
Revision as of 13:02, 13 May 2024
Smooth reflexive lattice polytopes in dimensions up to 9, up to lattice equivalence. The lists were computed with the algorithm of Mikkel Oebro (see [[http://arxiv.org/abs/0704.0049|arxiv: 0704.0049]]) and are taken from the [[http://polymake.org/polytopes/paffenholz/www/fano.html|website of Andreas Paffenholz]]. They also contain splitting data according to [[https://arxiv.org/abs/1711.02936| arxiv: 1711.02936]].
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polytopes.Lattice.SmoothReflexive |
Smooth reflexive lattice polytopes in dimensions up to 9, up to lattice equivalence. The lists were computed with the algorithm of Mikkel Oebro (see [[http://arxiv.org/abs/0704.0049|arxiv: 0704.0049]]) and are taken from the [[http://polymake.org/polytopes/paffenholz/www/fano.html|website of Andreas Paffenholz]]. They also contain splitting data according to [[https://arxiv.org/abs/1711.02936| arxiv: 1711.02936]]. |
Statements
Smooth reflexive lattice polytopes in dimensions up to 9, up to lattice equivalence. The lists were computed with the algorithm of Mikkel Oebro (see [[http://arxiv.org/abs/0704.0049|arxiv: 0704.0049]]) and are taken from the [[http://polymake.org/polytopes/paffenholz/www/fano.html|website of Andreas Paffenholz]]. They also contain splitting data according to [[https://arxiv.org/abs/1711.02936| arxiv: 1711.02936]].
0 references
