Files related to the paper<br>
S.Yu.Orevkov, "Asymptotics of the number of lattice triangulations of rectangles of width 4 and 5",
arXiv:2412.17065v1
<br>
<br>
Last update: March 6, 2025
<br>
<br>

The <b>Wolfram Mathematica</b> code for checking the identities in Section 2:
<A href="http://picard.ups-tlse.fr/~orevkov/t4.math">t4.math</A> <br><p>

The <b>Wolfram Mathematica</b> code for checking the identities in Section 3:
<A href="http://picard.ups-tlse.fr/~orevkov/t5.math">t5.math</A> <br><p>

The <b>MATLAB</b> program for computation of &nbsp;J(x)&nbsp; (see Section 2):
<A href="http://picard.ups-tlse.fr/~orevkov/J.m">J.m</A> <br><p>

The <b>MATLAB</b> program for computation of &nbsp;det(I-L(x))&nbsp; (see Section 3):
<A href="http://picard.ups-tlse.fr/~orevkov/L.m">L.m</A> <br><p>

<p>
<br>
The constant c_3 = log_2 lim_n f(3,n)^{1/(3n)} up to 1100 digits:
<A href="http://picard.ups-tlse.fr/~orevkov/tr-c3-1100.txt">tr-c3-1100.txt</A> <br><p>