Exact Subexponential Counting of Closed Plane Meanders
We give a deterministic algorithm for the exact number Mₙ of closed plane meanders of order n. Its input is n, and its bit complexity is 2^{O(√n log n)}. Splitting each crossing into an upper and a lower point yields a bijection with specified plane Hamilton cycles on a fixed 4n-point set. Each such cycle has a unique constrained Delaunay completion with local labels. The implementation counts these completions by separating periodically spaced hull layers and using a triangle recurrence within each resulting region. The exact outputs agree with the reference counts through order 4. Separately, we prove the core coverage theorem Θ: every core has a reversible deletion of a consecutive arc that leaves a core of the preceding order.
Authors
- Efthimios Alepis (ORCID: https://orcid.org/0000-0002-3862-7218)
Institutions
- University of Piraeus (GR)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24421401
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint