arXiv · cond-mat/0003008
Exact Meander Asymptotics: a Numerical Check
Abstract
This note addresses the meander enumeration problem: "Count all topologically inequivalent configurations of a closed planar non self-intersecting curve crossing a line through a given number of points". We review a description of meanders introduced recently in terms of the coupling to gravity of a two-flavored fully-packed loop model. The subsequent analytic predictions for various meandric configuration exponents are checked against exact enumeration, using a transfer matrix method, with an excellent agreement.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Philippe Di Francesco, Emmanuel Guitter, Jesper Lykke Jacobsen. 2000-03-01. Exact Meander Asymptotics: a Numerical Check. https://doi.org/10.1016/s0550-3213(00)00273-x
Cite the original work for its findings. Save a collection to share your selection of sources.