Generating Special Triangulations with Transformers

Charles Arnal, Jacky H. T. Yip, François Charton, Gary Shiu
6/25/2026
hep-thcs.LGmath.AG

No confident code implementation found for this paper.

Abstract

Triangulations, i.e., well-structured decompositions of geometric objects into triangle-like pieces, are central objects in many domains of mathematics and physics. In particular, fine, regular, and star triangulations (FRSTs) of 4D reflexive polytopes give rise to smooth Calabi-Yau threefolds, which are of significant interest in string theory. However, the high dimensionality and combinatorial complexity of triangulations make them particularly challenging to model with classical numerical methods or machine learning. In this work, we show that transformers, equipped with an appropriate encoding scheme, can be effectively trained to representatively generate new FRSTs across a range of polytope sizes. Moreover, these models can also self-improve through retraining on their own output. This opens the door to both concrete applications to the classification of Calabi-Yau manifolds and further research in physics, combinatorics and algebraic geometry.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{arnal2026generating,
  title  = {Generating Special Triangulations with Transformers},
  author = {Charles Arnal and Jacky H. T. Yip and François Charton and Gary Shiu},
  year   = {2026},
  eprint = {2606.26660},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.26660v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.26660.svg)](https://codeofpaper.com/paper/2606.26660)

Discussion