Bounds for the growth rate of meander numbers

Authors:
M. H. Albert;M. S. Paterson
Affiliations:
Department of Computer Science, University of Otago, Dunedin, New Zealand;Department of Computer Science, University of Warwick, Coventry, UK
Venue:
Journal of Combinatorial Theory Series A
Year:
2005

Citing 2
Cited 1

Plane and projective meanders

Selected papers of the conference on Formal power series and algebraic combinatorics
Combinatorial Enumeration

Combinatorial Enumeration

A fast algorithm to generate open meandric systems and meanders

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We provide improvements on the best currently known upper and lower bounds for the exponential growth rate of meanders. The method of proof for the upper bounds is to extend the Goulden-Jackson cluster method.