⚛️ high-energy theory

Calabi-Yau complete intersections in fake weighted projective spaces

This paper presents a classification algorithm for Calabi-Yau complete intersections in fake weighted projective spaces up to dimension five, identifying twenty new Hodge pairs not found in toric Calabi-Yau hypersurfaces and characterizing families of maximal codimension.

Original authors: Marco Ghirlanda

Published 2026-02-16

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Marco Ghirlanda

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are an architect trying to build a very specific, perfectly balanced type of house called a Calabi-Yau manifold. In the world of mathematics and string theory (which tries to explain the universe's smallest particles), these shapes are crucial because they represent the hidden dimensions of space.

Usually, architects build these houses by taking a single, giant, flexible sheet of material (a hypersurface) and stretching it over a specific frame. This has been done for decades, and we have a huge catalog of these single-sheet houses.

This paper is about a new, more complex way of building: using "intersections."

Instead of one big sheet, imagine building the house by taking several different sheets of material and stretching them all over the same frame at once. The house is formed only where all these sheets overlap. This is called a Complete Intersection. It's like finding the exact spot where three different shadows overlap on a wall; that tiny, specific shape is your house.

The Setting: "Fake" Projective Spaces

To build these, the author uses a special kind of construction site called a Fake Weighted Projective Space.

The Analogy: Think of a standard construction site (a "Weighted Projective Space") as a grid where every building block has a specific weight.
The "Fake" Twist: In this paper, the author allows for "fake" sites. These are sites that look like normal grids from a distance, but up close, they have some hidden, twisted rules (mathematical "torsion"). They are slightly "glitched" versions of the standard sites, but they still follow enough rules to be useful.

The Challenge: The "Nef-Partition" Recipe

To build a Calabi-Yau house, you can't just throw sheets together randomly. You need a specific recipe called a nef-partition.

The Metaphor: Imagine you have a giant pizza (the "anticanonical class"). To make a Calabi-Yau house, you must slice this pizza into specific pieces (blocks).
The Rule: Each piece of the pizza must be "nef" (a technical term meaning "nice" or "well-behaved"). If you slice the pizza wrong, the house collapses or isn't a Calabi-Yau.
The Goal: The author wants to find every possible way to slice the pizza in these "fake" sites so that the resulting overlapping house is valid.

What Did the Author Do? (The Algorithm)

The author, Marco Ghirlanda, wrote a computer program (an algorithm) to act as a super-efficient construction inspector.

The Weight Check: First, it lists all the possible "weights" (the size of the building blocks) that could work.
The Twist Check: Then, it checks the "fake" rules (the torsion) to see which of those weights actually hold up under the twisted conditions.
The Slicing: Finally, it tries every possible way to slice the pizza (partition the blocks) to see which slices create a valid house.

The Results: A New Catalog

The author ran this program for houses up to 5 dimensions (which is hard to visualize, but think of it as adding more layers of complexity to the blueprint).

The Count: They found thousands of new, unique house designs that no one had listed before.
The "Hodge Pairs": Every house has a "fingerprint" called a Hodge pair (two numbers that describe its shape and holes).
- The author found 20 new fingerprints that had never been seen before in the simpler "single-sheet" houses.
- Why it matters: It's like discovering 20 new species of birds that you thought were impossible to exist because you only looked at the ones that lived in trees. These new shapes might hold secrets for physics that the old ones didn't.

The "Maximal" Houses

The paper also looked at the most extreme cases: houses built with the maximum number of intersecting sheets possible.

The Analogy: Imagine trying to fit the maximum number of puzzle pieces into a box.
The Discovery: The author realized these extreme houses are mathematically equivalent to a game played with dots on a grid of 0s and 1s (like a binary code).
The Connection: They proved that counting these houses is the same as counting how many different ways you can arrange a group of dots on a binary grid so that they "cover" the whole grid, ignoring rotations and flips. This turns a super-hard geometry problem into a much simpler combinatorics puzzle.

Summary

In short, this paper is a master catalog of complex, multi-layered geometric shapes built on slightly "glitched" construction sites.

It provides a recipe book (algorithm) for finding them.
It lists thousands of new designs up to 5 dimensions.
It discovers 20 unique shapes that were previously unknown.
It simplifies the hardest cases by showing they are just binary dot puzzles.

This work expands our "zoo" of possible universes (in the mathematical sense), giving physicists and mathematicians more tools to explore the fundamental structure of reality.

1. Problem Statement

The paper addresses the classification of Calabi-Yau Complete Intersections (CYCI) within the context of Fake Weighted Projective Spaces (FWPS).

Context: While Calabi-Yau hypersurfaces in toric varieties (associated with reflexive polytopes) have been extensively classified (e.g., Kreuzer-Skarke lists), the classification of complete intersections arising from nef-partitions in more general toric settings remains challenging.
Specific Setting: The author focuses on FWPS, which are $\mathbb{Q}$ -factorial toric Fano varieties of Picard number one. These are generalizations of standard weighted projective spaces where the class group may contain torsion.
Goal: To develop a classification algorithm for CYCIs arising from nef-partitions in FWPS up to dimension five, compute their topological invariants (Hodge numbers), and characterize families of maximal codimension.

2. Methodology

The author proposes a combinatorial classification algorithm that extends previous work on reflexive simplices to the nef-partition setting. The methodology relies on the following key steps:

A. Combinatorial Framework

Degree Matrices: An FWPS is encoded by an integral degree matrix $Q$ derived from the vertices of a Fano simplex. The class group $\text{Cl}(Z)$ is isomorphic to $\mathbb{Z} \oplus \mathbb{Z}/\mu_1\mathbb{Z} \oplus \dots \oplus \mathbb{Z}/\mu_r\mathbb{Z}$ .
Nef-Partition Condition: A partition of the columns of $Q$ into blocks corresponds to a nef-partition if the sum of the columns in each block represents a Cartier divisor class (an element of the Picard group).
Decoupling Constraints: The author reformulates the existence condition for nef-partitions (Proposition 3.1) to separate constraints into:
1. Free part: Conditions on the weights $w_i$ (integers).
2. Torsion part: Conditions on the torsion coordinates $\eta_i$ (elements of finite cyclic groups). Crucially, the torsion conditions can be verified row-wise, allowing for a two-stage enumeration.

B. The Classification Algorithm (Algorithm 3.7)

The algorithm proceeds in two main stages:

Enumeration of Free Weight Data (Procedure 3.3):
- Generates all admissible "s-nef weight vectors" $w$ (primitive, non-decreasing integer tuples) that satisfy divisibility conditions related to the least common multiple (LCM) of weights and their sums.
- Identifies all valid partitions of these weights into blocks that satisfy the Cartier condition for the free part of the class group.
Adjoining Torsion Data:
- For each valid weight vector, the algorithm generates "minimal s-nef torsion vectors" (representatives of torsion classes).
- It combines the free data with torsion data to form full degree matrices $Q$ .
- It filters these matrices to ensure the intersection of nef-partitions across all torsion rows is non-empty.
- Finally, it filters for isomorphism classes of the resulting FWPS.

C. Maximal Codimension Characterization

For CYCIs of maximal codimension ( $s = d+1$ in dimension $d$ ), the author provides a structural characterization (Proposition 4.1 & 4.2). These varieties correspond to specific configurations where all torsion orders are 2, and the problem reduces to counting orbits of multisets of points in a vector space over $\mathbb{Z}/2\mathbb{Z}$ under the action of the Affine General Linear Group.

3. Key Contributions and Results

A. Classification Data (Theorem 1.1)

The paper provides a complete enumeration of CYCIs arising from nef-partitions in FWPS up to dimension 5. The results are tabulated by dimension ( $d$ ) and codimension ( $s$ ).

Scale: The dataset is massive; for example, in dimension 5 with codimension 1, there are 309,019,970 distinct families.
Availability: The full dataset is available on Zenodo.

B. Hodge Number Computations (Corollary 1.2)

Using the software PALP, the author computed the Hodge numbers for the 3-dimensional families (Calabi-Yau threefolds).

Total Pairs: The study identified 862 distinct Hodge pairs $(h^{1,1}, h^{2,1})$ $(h^{1, 1}, h^{2, 1})$ across all codimensions.
- Codimension 1: 716 pairs.
- Codimension 2: 121 pairs.
- Codimension 3: 19 pairs.
- Codimension 4: 6 pairs.
Novelty: 20 new Hodge pairs were discovered that are not realized by any toric Calabi-Yau hypersurface associated with 4-dimensional reflexive polytopes. These pairs are explicitly listed (e.g., $(1, 25)_2$ , $(2, 58)_{2,3,4}$ , etc.). This expands the known landscape of mirror symmetry in toric geometry.

C. Structural Characterization

The paper provides an explicit bijection between CYCIs of maximal codimension and the orbits of multisets of points in $(\mathbb{Z}/2\mathbb{Z})^r$ under the affine general linear group. This theoretical result simplifies the classification of these specific high-codimension cases.

4. Significance

Expansion of the Mirror Symmetry Landscape: By identifying 20 new Hodge pairs, the paper demonstrates that Calabi-Yau complete intersections in FWPS provide a richer source of mirror pairs than standard hypersurfaces in reflexive polytopes.
Algorithmic Advancement: The proposed algorithm successfully handles the complexity introduced by torsion in the class group, a significant hurdle in toric geometry classification. The separation of free and torsion constraints makes the enumeration computationally feasible for higher dimensions.
Data Generation: The generation of a dataset containing hundreds of millions of entries (for dimension 5) provides a valuable resource for further theoretical and phenomenological studies in string theory and algebraic geometry.
Theoretical Insight: The characterization of maximal codimension cases links the geometric problem to combinatorial problems in finite vector spaces, offering a new perspective on the structure of these varieties.

In summary, this work represents a major step forward in the systematic classification of Calabi-Yau varieties in toric settings, moving beyond hypersurfaces to complete intersections and beyond standard weighted projective spaces to their "fake" (torsion-containing) counterparts.