Asymptotics of the number of primitive lattice triangulations of rectangles of width $4$ and $5$
Sbornik: Mathematics · 2026 · 217 (2) · 197-225
DOI: 10.4213/sm10247e ↗At a glance
Journal article in Sbornik: Mathematics, published online on 2026-04-21. Written by Stepan Yur'evich Orevkov. 11 references. Funded by: Russian Science Foundation.
Abstract (original language)
Let $f(m,n)$ be the number of primitive lattice triangulations of an $m \times n$ rectangle. We express the limits $\lim_n f(m,n)^{1/n}$ for $m = 4$ and $m=5$ in terms of certain systems of Fredholm integral equations on generating functions (the case $m\le3$ was treated in [7]). Solving these equations numerically, we compute approximate values of these limits with a rather high precision. Bibliography: 11 titles.
Funding
- Russian Science Foundation
Cite
APA
Orevkov, S. Y. (2026). Asymptotics of the number of primitive lattice triangulations of rectangles of width $4$ and $5$. Sbornik: Mathematics, 217(2), 197-225. https://doi.org/10.4213/sm10247e
Vancouver
Orevkov SY. Asymptotics of the number of primitive lattice triangulations of rectangles of width $4$ and $5$. Sbornik: Mathematics. 2026;217(2):197-225. doi:10.4213/sm10247e
BibTeX
@article{Orevkov2026,
author = {Orevkov, Stepan Yur'evich},
title = {Asymptotics of the number of primitive lattice triangulations of rectangles of width $4$ and $5$},
journal = {Sbornik: Mathematics},
year = {2026},
volume = {217},
number = {2},
pages = {197--225},
doi = {10.4213/sm10247e}
}
EUVIMED