# Meander (mathematics)

In mathematics, a **meander** or **closed meander** is a self-avoiding closed curve which intersects a line a number of times. Intuitively, a meander can be viewed as a road crossing a river through a number of bridges.

## Contents

## Meander[edit]

Given a fixed oriented line *L* in the Euclidean plane **R**^{2}, a **meander** of order *n* is a non-self-intersecting closed curve in **R**^{2} which transversally intersects the line at 2*n* points for some positive integer *n*. The line and curve together form a **meandric system**. Two meanders are said to be equivalent if there is a homeomorphism of the whole plane that takes *L* to itself and takes one meander to the other.

### Examples[edit]

The meander of order 1 intersects the line twice:

The meanders of order 2 intersect the line four times.

### Meandric numbers[edit]

The number of distinct meanders of order *n* is the **meandric number** *M _{n}*. The first fifteen meandric numbers are given below (sequence A005315 in the OEIS).

*M*_{1}= 1*M*_{2}= 1*M*_{3}= 2*M*_{4}= 8*M*_{5}= 42*M*_{6}= 262*M*_{7}= 1828*M*_{8}= 13820*M*_{9}= 110954*M*_{10}= 933458*M*_{11}= 8152860*M*_{12}= 73424650*M*_{13}= 678390116*M*_{14}= 6405031050*M*_{15}= 61606881612

### Meandric permutations[edit]

A **meandric permutation** of order *n* is defined on the set {1, 2, ..., 2*n*} and is determined by a meandric system in the following way:

- With the line oriented from left to right, each intersection of the meander is consecutively labelled with the integers, starting at 1.
- The curve is oriented upward at the intersection labelled 1.
- The cyclic permutation with no fixed points is obtained by following the oriented curve through the labelled intersection points.

In the diagram on the right, the order 4 meandric permutation is given by (1 8 5 4 3 6 7 2). This is a permutation written in cyclic notation and not to be confused with one-line notation.

If π is a meandric permutation, then π^{2} consists of two cycles, one containing of all the even symbols and the other all the odd symbols. Permutations with this property are called *alternate permutations*, since the symbols in the original permutation alternate between odd and even integers. However, not all alternate permutations are meandric because it may not be possible to draw them without introducing a self-intersection in the curve. For example, the order 3 alternate permutation, (1 4 3 6 5 2), is not meandric.

## Open meander[edit]

Given a fixed oriented line *L* in the Euclidean plane **R**^{2}, an **open meander** of order *n* is a non-self-intersecting oriented curve in **R**^{2} which transversally intersects the line at *n* points for some positive integer *n*. Two open meanders are said to be equivalent if they are homeomorphic in the plane.

### Examples[edit]

The open meander of order 1 intersects the line once:

The open meander of order 2 intersects the line twice:

### Open meandric numbers[edit]

The number of distinct open meanders of order *n* is the **open meandric number** *m _{n}*. The first fifteen open meandric numbers are given below (sequence A005316 in the OEIS).

*m*_{1}= 1*m*_{2}= 1*m*_{3}= 2*m*_{4}= 3*m*_{5}= 8*m*_{6}= 14*m*_{7}= 42*m*_{8}= 81*m*_{9}= 262*m*_{10}= 538*m*_{11}= 1828*m*_{12}= 3926*m*_{13}= 13820*m*_{14}= 30694*m*_{15}= 110954

## Semi-meander[edit]

Given a fixed oriented ray *R* in the Euclidean plane **R**^{2}, a **semi-meander** of order *n* is a non-self-intersecting closed curve in **R**^{2} which transversally intersects the ray at *n* points for some positive integer *n*. Two semi-meanders are said to be equivalent if they are homeomorphic in the plane.

### Examples[edit]

The semi-meander of order 1 intersects the ray once:

The semi-meander of order 2 intersects the ray twice:

### Semi-meandric numbers[edit]

The number of distinct semi-meanders of order *n* is the **semi-meandric number** * M_{n}* (usually denoted with an overline instead of an underline). The first fifteen semi-meandric numbers are given below (sequence A000682 in the OEIS).

*M*_{1}= 1*M*_{2}= 1*M*_{3}= 2*M*_{4}= 4*M*_{5}= 10*M*_{6}= 24*M*_{7}= 66*M*_{8}= 174*M*_{9}= 504*M*_{10}= 1406*M*_{11}= 4210*M*_{12}= 12198*M*_{13}= 37378*M*_{14}= 111278*M*_{15}= 346846

## Properties of meandric numbers[edit]

There is an injective function from meandric to open meandric numbers:

*M*=_{n}*m*_{2n−1}

Each meandric number can be bounded by semi-meandric numbers:

≤__M___{n}*M*≤_{n}__M___{2n}

For *n* > 1, meandric numbers are even:

*M*≡ 0 (mod 2)_{n}