Exact meander asymptotic: a numerical check

This note addresses the meander enumeration problem: "count all topological ly inequivalent configurations of a closed planar non self-intersecting cur ve crossing a line through a given number of points". We review a descripti on 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 enum eration, using a transfer matrix method, with an excellent agreement. (C) 2 000 Elsevier Science B.V. All rights reserved.