Enumeration of meander configurations

Determine the general enumeration of meander configurations and their precise asymptotic behavior as the number of intersection points tends to infinity.

Background

The paper studies singular meanders, in which tangencies are allowed, and contrasts them with the classical non-singular meander problem. Although substantial progress has been made on meander enumeration, the authors identify the general counting problem and the precise asymptotic behavior of meander numbers as unresolved. This problem concerns the classical meander numbers, rather than the s-meandric permutation counts that are analyzed further in the paper.

References

Despite considerable progress, the general enumeration problem and the precise asymptotic behavior of meander numbers remain open.

— S-meandric Permutations and Tangency Polynomials  (2609.30068 - Belousov et al., 24 Sep 2026) in Section 1, Introduction

The counting combinatorics of Sturm permutations and meanders remains elusive, in general.

— Counting Hamiltonian Sturm permutations: generating functions and Gaussian distributions  (2610.03611 - Fiedler et al., 2 Oct 2026) in Section 1, Introduction and outline

An explicit formula for the meandric numbers is not known; nonetheless, close lower and upper bounds are known.

— Faster Planar Graph Algorithms for Connectivity Problems via Meanders  (2610.11944 - Caroppo et al., 8 Oct 2026) in Section 2, Preliminaries, paragraph “Meanders”

A central question left open by our work is to better understand the asymptotic growth of the meandric systems that arise in these dynamic programming algorithms. Our running times depend directly on upper bounds for the growth constants of acyclic unidirectional open meandric systems and the forest open meandric systems introduced here.

— Faster Planar Graph Algorithms for Connectivity Problems via Meanders  (2610.11944 - Caroppo et al., 8 Oct 2026) in Section 8, Conclusions and Open Problems