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.
References
Despite considerable progress, the general enumeration problem and the precise asymptotic behavior of meander numbers remain open.
The counting combinatorics of Sturm permutations and meanders remains elusive, in general.
An explicit formula for the meandric numbers is not known; nonetheless, close lower and upper bounds are known.
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.