A permutation of a set is a bijection from that set to itself.
A cyclic ordering of a finite ground set records its elements around an oriented circle, identifying permutations that differ by rotation. There are such orderings for . A uniformly random permutation induces a uniformly random cyclic ordering.
A cyclic interval of length is the set of consecutive positions in a cyclic ordering. For , there are distinct intervals, one ending at each position. Under a uniformly random permutation, a fixed -set appears as an interval with probability . This is the counting mechanism of the Katona circle method.
A generalised permutation is a finite multiset of ordered pairs, displayed as a two-row array or encoded by a finite-support matrix of nonnegative integer multiplicities . The no-repeated-column condition means every multiplicity is zero or one; entries within either individual row may still repeat.
For a permutation of , an inversion is a pair with . Its number equals the Coxeter length for adjacent transpositions: each adjacent swap changes the count by one, and swapping adjacent descents sorts the permutation in exactly that many steps.
A transposition is a permutation that exchanges two elements and fixes every other element. Every transposition has order two.
A product of two transpositions is the identity when they coincide, a three-cycle when their supports meet in one letter, and a product of two disjoint permutation cycles when their supports are disjoint.
A permutation of has displacement at most one when . Such a permutation is a disjoint collection of fixed points and adjacent transpositions, so independently swapping the pairs already gives uncountably many examples.

Ancestors (4)

  1. Combinatorics
  2. Area of mathematics
  3. Mathematics
  4. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)

A permutation is a specific arrangement of a set of items or elements. In mathematics, particularly in combinatorics, permutations refer to the different ways in which a subset of objects can be ordered or arranged. For example, if you have a set of three items, say \( \{A, B, C\} \), the possible permutations of these items are: 1. ABC 2. ACB 3. BAC 4. BCA 5. CAB 6.