Exact Subexponential Counting of Closed Plane Meanders
Year: 2026
Type: preprint
Abstract: 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.
Author: Alepis, Efthimios
Institution: University of Piraeus
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7237352105
Cites:
Cited by:
Related to:
