A transfer matrix approach to the enumeration of plane meanders

DOI10.1088/0305-4470/33/34/301zbMATH Open0962.05006arXivcond-mat/0008178OpenAlexW2010556943MaRDI QIDQ4520686FDOQ4520686

Authors: I. Jensen 

Publication date: 13 December 2000

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. While the algorithm has exponential complexity, its rate of growth is much smaller than that of previous algorithms. The algorithm is easily modified to enumerate various systems of closed meanders, semi-meanders, open meanders and many other geometries.

Full work available at URL: https://arxiv.org/abs/cond-mat/0008178

Recommendations

• Critical exponents of plane meanders
• Publication:4945720
• scientific article; zbMATH DE number 516158
• On meandric colliers
• scientific article; zbMATH DE number 1222120
• scientific article; zbMATH DE number 2208541
• scientific article; zbMATH DE number 2210953
• A constructive enumeration of meanders
• Publication:4509137
• Meander, folding, and arch statistics

zbMATH Keywords

transfer matrixmeanderenumeration of plane meanders

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15)

Cited In (20)

• Meanders: a personal perspective to the memory of Pierre Rosenstiehl
• Plane and projective meanders
• Pattern avoiding meandric permutations
• Title not available (Why is that?)
• Meanders, hyperelliptic pillowcase covers, and the Johnson filtration
• Realization of meander permutations by boundary value problems
• On meandric colliers
• Title not available (Why is that?)
• Compression of meanders
• Critical exponents of plane meanders
• Generating cyclic rotation Gray codes for stamp foldings and semi-meanders
• Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
• Partitioning the meandering curves
• Cycles in random meander systems
• Title not available (Why is that?)
• A constructive enumeration of meanders
• A fast algorithm to generate open meandric systems and meanders
• Bounds for the growth rate of meander numbers
• Title not available (Why is that?)
• Enumeration of meanders and Masur-Veech volumes

This page was built for publication: A transfer matrix approach to the enumeration of plane meanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520686)