Enumerations of plane meanders

نویسنده

  • Iwan Jensen
چکیده

A closed plane meander of order n is a closed self-avoiding loop 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. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is easily modified to enumerate various systems of closed meanders, semi-meanders or open meanders.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical exponents of plane meanders

Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, n. 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 meander...

متن کامل

A transfer matrix approach to the enumeration of plane meanders

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 tha...

متن کامل

On the Representation of Meanders

We will introduce a new approach for studying plane meanders. The set of all meanders of order n possesses a natural order structure and forms a graded poset. We will show how these representations can be used to develop an efficient and very flexible construction algorithm and how to obtain counting formulae for meanders.

متن کامل

Refined Enumerations of Totally Symmetric Self-Complementary Plane Partitions and Lattice Path Combinatorics

This article is a short explanation of some of the results obtained in my papers “On refined enumerations of totally symmetric self-complementary plane partitions I, II”. We give Pfaffian expressions for some of the conjectures in the paper “Self-complementary totally symmetric plane partitions” (J. Combin. Theory Ser. A 42, 277–292) by Mills, Robbins and Rumsey, using the lattice path method.

متن کامل

Meandering rivulets on a plane: a simple balance between inertia and capillarity.

Experiments on streams of water flowing down a rigid substrate have been performed for various plate inclinations and flow rates, and we focused on the regime of stationary meanders. The outcome is that (i) the flow is highly hysteretic--the shape of the meanders varies with flow rate only for increasing flow rates, and the straight rivulet regime does not appear for decreasing flow rate, and (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999