Editing Meander (mathematics) (section)

===Meandric permutations===
[[File:meander_example_1_8_5_4_3_6_7_2.svg|thumb|{{center|Meandric permutation <br />(1 8 5 4 3 6 7 2)}}]]
A '''meandric permutation''' of order ''n'' is defined on the set {1, 2, ..., 2''n''} and is determined as follows:
* 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 π<sup>2</sup> consists of two [[cyclic permutation|cycles]], one containing 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.