The symmetric capacity conjecture for unimodular triangulations

Less than 1 year old · traced to

Let f~(d)\widetilde{f}(d) be the logarithm of the number of H\mathfrak{H}-invariant unimodular triangulations of d⋅Δ2d\cdot\Delta_2, and define the symmetric capacity by

c~=lim⁡d→∞2f~(d)d(d−1).\widetilde{c}=\lim_{d\to\infty}\frac{2\widetilde{f}(d)}{d(d-1)}.

Symmetric capacity conjecture. The symmetric capacity satisfies

c~=1.\widetilde{c}=1.

The preceding bounds imply 12≤c~≤32\frac12\leq\widetilde{c}\leq\frac32, while numerical regression suggests the value 11; establishing the asymptotic limit remains open.

References

Primary source

Kamillo Ferry, Michael Joswig and Jörg Rambau, “Counting symmetric unimodular triangulations”, arXiv:2605.14150 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.