arxiv: 2605.14150 · v1 · submitted 2026-05-13 · 🧮 math.CO · math.AG

Recognition: no theorem link

Counting symmetric unimodular triangulations

Kamillo Ferry , Michael Joswig , J\"org Rambau

Authors on Pith no claims yet

Pith reviewed 2026-05-15 02:06 UTC · model grok-4.3

classification 🧮 math.CO math.AG

keywords symmetric triangulationsunimodular triangulationsdilated triangleenumerationcombinatoricsT-curvesbounds on counts

0 comments

The pith

Lower and upper bounds are established for the number of symmetric unimodular triangulations of the dilated standard triangle with a fixed symmetry axis, along with complete enumerations for small cases.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines unimodular triangulations of the dilated standard triangle that possess symmetry with respect to a fixed axis. It derives lower and upper bounds on the total count of such triangulations and provides explicit lists for the smallest dilation factors. This focus stems from applications to T-curves. Readers might find this useful because it quantifies how symmetry reduces the complexity of counting triangulations in the plane.

Core claim

For the dilated standard triangle, the symmetric unimodular triangulations with a fixed symmetry axis admit lower and upper bounds on their numbers, and the paper supplies the complete list of all such triangulations when the dilation is small.

What carries the argument

The symmetric unimodular triangulation with a fixed symmetry axis, which enforces reflection symmetry across the axis while maintaining unimodularity on the integer lattice points.

If this is right

The total number of such triangulations lies between the provided lower and upper bounds for any dilation.
Exact counts are available for the smallest values of the dilation parameter.
This enumeration can serve as a basis for generating or classifying symmetric structures in related geometric problems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

These bounds might extend to counting symmetric triangulations in higher-dimensional polytopes.
Symmetry constraints could lead to recursive formulas for the numbers at larger dilations.
The connection to T-curves suggests applications in real algebraic geometry for counting real curves with symmetry.

Load-bearing premise

The symmetry must be with respect to one fixed axis and the triangulations must be unimodular in the lattice sense.

What would settle it

A computation or construction of a symmetric unimodular triangulation for a dilation size where the count exceeds the upper bound or falls below the lower bound would falsify the claims.

Figures

Figures reproduced from arXiv: 2605.14150 by J\"org Rambau, Kamillo Ferry, Michael Joswig.

**Figure 2.** Figure 2: Subdividing d · T into vertical strips to obtain a lower bound of unimodular triangulations. When d is even, d · T itself is symmetric along the { x = d 2 } line. For d odd, there is an additional vertical strip centered at x = d 2 . The following computation gives an explicit lower bound in the even case, the odd case is carried out analogously: L1(d) = d 2Y−1 n=0 2n n 2 ≥ d 2Y−1 n=1 1 2n 2 2n 2 = 2… view at source ↗

**Figure 3.** Figure 3: Symmetric triangulations of d·∆2 for d = 6, 7 together with quadrangles along the { x = y } line. Note how for odd d, the triangle consisting of the points (⌊ d 2 ⌋, ⌊ d 2 ⌋), (⌊ d 2 ⌋, ⌈ d 2 ⌉) and (⌈ d 2 ⌉, ⌊ d 2 ⌋) is fixed by the symmetry of the triangulation. 4. Upper bounds There are H-invariant unimodular triangulations that cannot be obtained (directly) from a unimodular triangulation of d · T usi… view at source ↗

**Figure 4.** Figure 4: Cases of triangles discussed in the proof of Lemma 5. Cases b) and c) fail to be unimodular, while d)-f) fail to be H-feasible [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗

read the original abstract

The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds are given, in combination with full enumerations of a few small cases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives explicit lower and upper bounds plus small-case enumerations for symmetric unimodular triangulations of the dilated standard triangle under a fixed axis.

read the letter

The main point is that this work counts symmetric unimodular triangulations of the dilated standard triangle with respect to one fixed symmetry axis. It supplies concrete lower and upper bounds and lists all examples for small dilation parameters. That is the actual new content: the symmetric restriction was left open in the earlier T-curves papers, and here it is handled directly with standard lattice-point and volume-one conditions for unimodularity plus reflection invariance across the axis. The enumerations are exhaustive for the small cases, which makes them checkable by anyone with the same setup. The bounds rest on straightforward counting arguments that match conventions already used in the literature, so there is no circularity or hidden fitting. The paper stays within its stated scope and does not claim asymptotics or closed forms. The main limitation is that the bounds are not shown to be tight for larger dilations and the enumerations stop at small sizes, which is typical for this kind of enumeration but means the results are mainly useful as concrete data points rather than a general theory. Readers already working on triangulations or on the T-curves side of algebraic geometry will find the numbers and bounds directly usable for further checks or extensions. The work is narrow but cleanly executed, with verifiable computations and no evident gaps in the definitions. I would send it to peer review; a referee can confirm the enumeration code and the bound derivations without much trouble.

Referee Report

0 major / 3 minor

Summary. The manuscript defines symmetric unimodular triangulations of the dilated standard triangle with respect to a fixed axis. It supplies explicit lower and upper bounds on the number of such triangulations for general dilation parameters together with exhaustive enumerations for small values of the dilation parameter, motivated by work on T-curves.

Significance. If the bounds and enumerations hold, the work supplies concrete combinatorial data and estimates for symmetric lattice triangulations. The small-case enumerations provide verifiable test points that can support further asymptotic analysis or connections to T-curves in algebraic geometry.

minor comments (3)

The abstract mentions 'a few small cases' but does not specify the exact range of dilation parameters enumerated; adding this would improve clarity for readers.
§2: the definition of the fixed symmetry axis could include an explicit coordinate description or diagram to make the reflection-invariance condition immediately visible.
The references section should confirm that the 2026 Geiselmann et al. citation is complete and that all prior literature on unimodular triangulations is consistently cited.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive assessment of our manuscript on counting symmetric unimodular triangulations of dilated triangles and for recommending minor revision. We appreciate the recognition of the combinatorial data and potential links to T-curves.

read point-by-point responses

Referee: The manuscript defines symmetric unimodular triangulations of the dilated standard triangle with respect to a fixed axis. It supplies explicit lower and upper bounds on the number of such triangulations for general dilation parameters together with exhaustive enumerations for small values of the dilation parameter, motivated by work on T-curves.

Authors: We thank the referee for this accurate summary of the paper's contributions. The bounds and enumerations are indeed the core results, and the motivation from T-curves (Geiselmann et al., 2026) is correctly noted. revision: no

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The manuscript defines symmetric unimodular triangulations of the dilated standard triangle via the standard lattice-point and volume-1 conditions together with explicit reflection invariance across a fixed axis. Lower/upper bounds and exhaustive enumerations for small dilation parameters are derived directly from these combinatorial definitions and standard T-curve conventions cited from external literature (Geiselmann et al., 2026). No parameter is fitted to a subset of the target counts and then re-used as a prediction, no uniqueness theorem is imported from the authors' own prior work, and no ansatz or renaming reduces the central counting claims to the inputs by construction. The derivation chain is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The abstract does not specify any free parameters, axioms, or invented entities; the work relies on standard definitions in combinatorial geometry.

pith-pipeline@v0.9.0 · 5338 in / 955 out tokens · 43457 ms · 2026-05-15T02:06:51.933540+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages

[1]

Rambau, J\"org , title =

work page
[2]

and Rambau, J\"org and Santos, Francisco , TITLE =

De Loera, Jes\'us A. and Rambau, J\"org and Santos, Francisco , TITLE =. 2010 , ISBN =. doi:10.1007/978-3-642-12971-1 , URL =

work page doi:10.1007/978-3-642-12971-1 2010
[3]

Orevkov, S. Yu. , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 1999 , NUMBER =. doi:10.1006/jcta.1998.2921 , URL =

work page doi:10.1006/jcta.1998.2921 1999
[4]

, TITLE =

Anclin, Emile E. , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 2003 , NUMBER =. doi:10.1016/S0097-3165(03)00097-9 , URL =

work page doi:10.1016/s0097-3165(03)00097-9 2003
[5]

Aichholzer, Oswin and Hurtado, Ferran and Noy, Marc , TITLE =. Comput. Geom. , FJOURNAL =. 2004 , NUMBER =. doi:10.1016/j.comgeo.2004.02.003 , URL =

work page doi:10.1016/j.comgeo.2004.02.003 2004
[6]

19 David R

Welzl, Emo , TITLE =. Graph drawing , SERIES =. 2007 , ISBN =. doi:10.1007/978-3-540-70904-6\_1 , URL =

work page doi:10.1007/978-3-540-70904-6 2007
[7]

, TITLE =

Kaibel, Volker and Ziegler, G\"unter M. , TITLE =. Surveys in combinatorics, 2003 (. 2003 , ISBN =

work page 2003
[8]

Orevkov, S. Yu. , TITLE =. Mat. Sb. , FJOURNAL =. 2022 , NUMBER =. doi:10.4213/sm9727 , URL =

work page doi:10.4213/sm9727 2022
[9]

Orevkov, S. Yu. , title =. 2022 , eprint =

work page 2022
[10]

Graphs Combin

Aichholzer, Oswin and Hackl, Thomas and Huemer, Clemens and Hurtado, Ferran and Krasser, Hannes and Vogtenhuber, Birgit , TITLE =. Graphs Combin. , FJOURNAL =. 2007 , PAGES =. doi:10.1007/s00373-007-0704-5 , _URL =

work page doi:10.1007/s00373-007-0704-5 2007
[11]

and Filliman, Paul and Sturmfels, Bernd , TITLE =

Billera, Louis J. and Filliman, Paul and Sturmfels, Bernd , TITLE =. Adv. Math. , FJOURNAL =. 1990 , NUMBER =. doi:10.1016/0001-8708(90)90077-Z , _URL =

work page doi:10.1016/0001-8708(90)90077-z 1990
[12]

2026 , note =

Geiselmann, Zoe and Joswig, Michael and Kastner, Lars and Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Wack, Marcel and Zimmer, Max , title =. 2026 , note =

work page 2026
[13]

2015 , ISBN =

Maclagan, Diane and Sturmfels, Bernd , TITLE =. 2015 , ISBN =

work page 2015
[14]

2008 , author =

Discriminants, resultants and multidimensional determinants , publisher =. 2008 , author =

work page 2008
[15]

2021 , ISBN =

Joswig, Michael , TITLE =. 2021 , ISBN =

work page 2021
[16]

Viro, O. Ya. , TITLE =. Topology (. 1984 , ISBN =. doi:10.1007/BFb0099934 , URL =

work page doi:10.1007/bfb0099934 1984
[17]

Electron

Sharir, Micha and Sheffer, Adam , TITLE =. Electron. J. Combin. , FJOURNAL =. 2011 , NUMBER =. doi:10.37236/557 , URL =

work page doi:10.37236/557 2011
[18]

Discrete Appl

Avis, David and Fukuda, Komei , Title =. Discrete Appl. Math. , Volume =. 1996 , DOI =

work page 1996