Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2412.12655 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914508278071296 |
|---|---|
| author | Fromentin, Jean Giscard, Pierre-Louis Hosten, Yohan |
| author_facet | Fromentin, Jean Giscard, Pierre-Louis Hosten, Yohan |
| contents | We build upon a recent theoretical breakthrough by employing novel algorithms to accurately compute the fractions $F_p$ of all closed walks on the infinite square lattice whose the last erased loop corresponds is any one of the $762, 207, 869, 373$ self-avoiding polygons $p$ of length at most 38. Prior to this work, only 6 values of $F_p$ had been calculated in the literature. The main computational engine uses efficient algorithms for both the construction of self-avoiding polygons and the precise evaluation of the lattice Green's function. Based on our results, we propose two conjectures: one regarding the asymptotic behavior of sums of $F_p$, and another concerning the value of $F_p$ when $p$ is a large square. We provide strong theoretical arguments supporting the second conjecture. Furthermore, the algorithms we introduce are not limited to the square lattice and can, in principle, be extended to any vertex-transitive infinite lattice. In establishing this extension, we resolve two open questions related to the triangular lattice Green's function. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_12655 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fast construction of self-avoiding polygons and efficient evaluation of closed walk fractions on the square lattice Fromentin, Jean Giscard, Pierre-Louis Hosten, Yohan Combinatorics We build upon a recent theoretical breakthrough by employing novel algorithms to accurately compute the fractions $F_p$ of all closed walks on the infinite square lattice whose the last erased loop corresponds is any one of the $762, 207, 869, 373$ self-avoiding polygons $p$ of length at most 38. Prior to this work, only 6 values of $F_p$ had been calculated in the literature. The main computational engine uses efficient algorithms for both the construction of self-avoiding polygons and the precise evaluation of the lattice Green's function. Based on our results, we propose two conjectures: one regarding the asymptotic behavior of sums of $F_p$, and another concerning the value of $F_p$ when $p$ is a large square. We provide strong theoretical arguments supporting the second conjecture. Furthermore, the algorithms we introduce are not limited to the square lattice and can, in principle, be extended to any vertex-transitive infinite lattice. In establishing this extension, we resolve two open questions related to the triangular lattice Green's function. |
| title | Fast construction of self-avoiding polygons and efficient evaluation of closed walk fractions on the square lattice |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.12655 |