Loop counts in closed meandric systems at large weight
Give each loop of a closed meandric system a weight q. A finite-window estimate proves an n^(−3/2) prefactor in the partition function for every fixed real q ≥ 18. As q tends to infinity, the deficit from the maximal loop count has a Poisson approximation in total variation. Substituting the leading mean 2n/q gives a crossover at q of order n^(1/3). The certificate for the fixed-weight bound uses exact rational arithmetic. Source text, verification programs and certificates for this version: https://github.com/Kimargin8/meander-connectivity-and-loop-weights/releases/tag/v2026.11.19
Authors
- Iaroslav Argunov
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24381890
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint