Foata transformation
Contents
Definition
Suppose is a totally ordered finite set of size . We denote by the symmetric group on . The typical case is that , but we sometimes want to use other labels, specifically other contiguous blocks of integers. In the case that , we call the group .
The Foata transformation, also called the Foata correspondence or Foata fundamental transformation, is a bijection from the symmetric group to itself described below. The transformation essentially relies on "punning" between the canonical notation for the cycle decomposition of a permutation and the one-line notation of the permutation being mapped to.
The correspondence hinges on the choice of total ordering on the set and is not invariant under group conjugations, nor is it a group homomorphism. Its significance is more combinatorial than algebraic.
Forward direction
Start with a permutation .
- Write the permutation in canonical cycle decomposition notation: By the cycle decomposition theorem, the permutation has a cycle decomposition. Write the cycle decomposition in canonical notation, including fixed points. Make sure to include fixed points as cycles of size one. Explicitly, this means:
- Cyclically rearrange each cycle so that it begins with its largest element.
- Arrange the cycles in increasing order of their largest elements.
- Reinterpret in one-line notation: Now, drop the commas and parentheses and you get a string of length that is the one-line notation for a permutation of (more explicitly, it is the second line of the two-line notation of the permutation of , where the first line is the elements of in ascending order with respect to their total order). This is the new permutation that is the image of the Foata transformation.
Reverse direction
The above two steps describe how to start with a permutation and apply the Foata transformation to it to obtain a new permutation. Here, we describe how to reverse the process, i.e., how to go from the image of a permutation under the Foata transformation back to the original permutation. The steps are:
- Write the permutation in one-line notation (i.e., write it as a string whose element is the image of the element of under the permutation).
- Traverse through the string from left to right, and identify all the left-to-right maxima, i.e., all the elements that are larger than the elements before them. The strings starting with a given left-to-right maxima and ending just before the next form the strings for the cycles in the canonical notation for the cycle decomposition of the original permutation.
Replacing largest with smallest
There are conflicting definitions of the canonical notation. Some definitions require that we use the smallest element, and decreasing order. Explicitly, they suggest that:
- We cyclically rearrange each cycle so that it begins with its smallest element.
- We order the cycles in decreasing order of their smallest elements.
The definitions are equivalent up to some other transformations, and are not conceptually too far apart, though there are cases where one definition is a little more useful than the other. We stick with the definition using largest elements, because then the Foata transformation fixes the identity element of the symmetric group.
Examples
Forward direction
Example 1
Consider the permutation of the set with one-line notation:
We first write this in cycle decomposition:
We now rewrite in canonical notation:
We now drop the parentheses and obtain the one-line notation for the transformed permutation:
Example 2
Consider the permutation of the set that sends every element to its fifth power modulo 7. The one-line notation for this permutation is:
The cycle decomposition of this permutation is:
Rearranging each cycle to begin with its largest element and arranging the cycles in increasing order of their largest element, we obtain:
Dropping parentheses, we get:
Example 3
Consider the permutation on given as . In one-line notation, the permutation is:
The permutation has the cycle decomposition:
In canonical notation, this becomes:
Dropping the parentheses, we get:
Reverse direction
Example 1
Consider a permutation of the set that multiplies everything by 3 mod 7. First, we write this in one-line notation:
Now, we identify the left-to-right maxima. They occur at 0, 3, and 6. The cycles of the new permutation are therefore (0), (3), and (6, 2, 5, 1, 4). The new permutation is therefore the following in cycle decomposition notation:
Dropping fixed points, we get a single 5-cycle:
In one-line notation, the new permutation is:
Example 2
Consider the permutation of the set given in one-line notation as follows:
The left-to-right maxima are 3, 5, 7, and 8, and the cycle decomposition is therefore:
In one-line notation, this becomes:
Behavior
Compatibility with maps of symmetric groups
The symmetric groups form an IAPS of groups, and explicitly, there are maps:
where the image of a pair of permutations is obtained by multiplying the first permutation on with the second permutation applied to the set (i.e., changing label to label .
The Foata transformation behaves nicely with respect to this homomorphism. Explicitly, if we denote the map above as , and the Foata transformations as respectively, then:
Fixed points
Based on the above compatibility observation, and the fact that the Foata transformation is the identity map on the symmetric groups of size one and two, we obtain that the Foata transformation's fixed points include all permutations whose cycle decomposition comprises fixed points and transpositions between adjacent elements (in terms of the description of the symmetric group as a Coxeter group, these transpositions are the generators, so we're really talking here about elements that are products of pairwise commuting elements of the Coxeter generating set). In fact, it can be proved that these are the only fixed points.
The number of such fixed points in , for of size , is:
where the value for a given is the number of fixed points that are products of pairwise disjoint transformations.
It can also be proved that this sum equals the Fibonacci number , and in particular, this means that the value for a given equals the sum of the values for the two preceding values of . There are two ways of proving it:
- Proving it from the product of transpositions description: The inductive step (showing that the value at is the sum of the values at and ) follows by making cases on whether the largest element is fixed. The base case involves a simple examination of the cases .
- Direct algebraic manipulation of the closed form expression above, using combinatorial identities satisfied by the binomial coefficients.
Value of | Number of fixed points | List of fixed points in one-line notation |
---|---|---|
1 | 1 | 1 |
2 | 2 | 12, 21 |
3 | 3 | 123, 213, 132 |
4 | 5 | 1234, 2134, 1324, 1243, 2143 |
5 | 8 | 12345, 21345, 13245, 12435, 12354, 21435, 21354, 13254 |