Pith. sign in

REVIEW 2 cited by

Log Calabi--Yau pairs of complexity zero and arbitrary index

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.05343 v1 pith:6TES4E33 submitted 2024-11-08 math.AG

classification math.AG
keywords calabi--yaucomplexityzeroarbitrarybirationalindexpairsadmits
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this article, we give a characterization of log Calabi--Yau pairs of complexity zero and arbitrary index. As an application, we show that a log Calabi--Yau pair of birational complexity zero admits a crepant birational model which is a generalized Bott tower.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Complexity one varieties are cluster type

    math.AG 2025-04 conditional novelty 7.0 of 10

    A log Calabi-Yau pair of index one and complexity at most one is a cluster type variety, and varieties of absolute complexity one admit a finite cluster type cover of degree at most two.

  2. Calabi-Yau pairs of complexity two

    math.AG 2024-12 conditional novelty 7.0 of 10

    A Calabi-Yau pair of complexity two is cluster type exactly when its standard model over a toric base is nodal, component-compatible, and volume-large; this classifies all rank-one Gorenstein del Pezzo surfaces.

Pith tools