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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Exact Subexponential Counting of Closed Plane Meanders

Efthimios Alepis
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Exact Subexponential Counting of Closed Plane Meanders

Efthimios Alepis
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
University of Piraeus (GR)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon