The DOI matches its Crossref record.
Classification of reflexive polyhedra in three dimensions
Open accessAbstract
We present the last missing details of our algorithm for the classification of reflexive polyhedra in arbitrary dimensions.We also present the results of an application of this algorithm to the case of three dimensional reflexive polyhedra.We get 4319 such polyhedra that give rise to K3 surfaces embedded in toric varieties.16 of these contain all others as subpolyhedra.The 4319 polyhedra form a single connected web if we define two polyhedra to be connected if one of them contains the other.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Complete classification of reflexive polyhedra in four dimensions
Kreuzer, M., & Skarke, H. (2000) · Advances in Theoretical and Mathematical Physics · doi:10.4310/atmp.2000.v4.n6.a2 · Cited by 472
Self-citationAlgorithmic universality in F-theory compactifications
Halverson, J., Long, C., & Sung, B. (2017) · Physical Review D · doi:10.1103/physrevd.96.126006 · Cited by 71
Metadata
- Authors
- Kreuzer, M., & Skarke, H.
- Venue
- Advances in Theoretical and Mathematical Physics
- Publisher
- International Press of Boston
- Published
- 1998
- Volume
- 2
- Issue
- 4
- Pages
- 853-871
- ISSN
- 1095-0753 (ISSN-L)
- 1095-0761
- OpenAlex
- W2963553657
- Cited by
- 167
- References
- 0
- FWCI
- 3.57
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.