Critical exponents of plane meanders
From MaRDI portal
Abstract: Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, . Meanders are considered distinct up to any smooth deformation leaving the line fixed. We use a recently developed algorithm, based on transfer matrix methods, to enumerate plane meanders. This allows us to calculate the number of closed meanders up to , the number of open meanders up to , and the number of semi-meanders up to . The analysis of the series yields accurate estimates of both the critical point and critical exponent, and shows that a recent conjecture for the exact value of the semi-meander critical exponent is unlikely to be correct, while the conjectured exponent value for closed and open meanders is not inconsistent with the results from the analysis.
Recommendations
Cited in
(11)- Meanders: Exact asymptotics
- A constructive enumeration of meanders
- Bounds for the growth rate of meander numbers
- Cycles in random meander systems
- scientific article; zbMATH DE number 1504567 (Why is no real title available?)
- A transfer matrix approach to the enumeration of plane meanders
- scientific article; zbMATH DE number 1424473 (Why is no real title available?)
- Pattern avoiding meandric permutations
- Exact meander asymptotics: a numerical check
- Meanders: a personal perspective to the memory of Pierre Rosenstiehl
- Plane and projective meanders
This page was built for publication: Critical exponents of plane meanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489894)