Affine Symmetric Group

The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects. Each one is an infinite extension of a finite symmetric group, the group of permutations (rearrangements) of a finite set. In addition to their geometric description, the affine symmetric groups may be defined as collections of permutations of the integers (..., −2, −1, 0, 1, 2, ...) that are periodic in a certain sense, or in purely algebraic terms as a group with certain generators and relations. They are studied as part of the fields of combinatorics and representation theory.

Many important combinatorial properties of the finite symmetric groups can be extended to affine symmetric groups. Permutation statistics such as descents and inversions can be defined in the affine case. As in the finite case, the natural combinatorial definitions for these statistics also have a geometric interpretation.

The affine symmetric groups have close relationships with other mathematical objects, including juggling patterns and certain complex reflection groups. Many of their combinatorial and geometric properties extend to the broader family of affine Coxeter groups.

Definitions

The affine symmetric group may be equivalently defined as an abstract group by generators and relations, or in terms of concrete geometric and combinatorial models.

Algebraic definition

One way of defining groups is by generators and relations. In this type of definition, generators are a subset of group elements that, when combined, produce all other elements. The relations of the definition are a system of equations satisfied by those elements that imply all of the other equations they satisfy. In this way, the affine symmetric group $\widetilde_n$ is generated by a set
$s_0, s_1, \ldots, s_$
of elements that satisfy the following relations: when $n \geq 3$,
# $s_i^2 = 1$ (the generators are involutions),
# $s_is_j = s_js_i$ if is not one of $i - 1, i, i + 1$, indicating that for these pairs of generators, the group operation is commutative, and
# $s_is_s_i = s_s_is_$.
In the relations above, indices are taken modulo , so that the third relation includes as a particular case $s_0s_s_0 = s_s_0s_$. (The second and third relation are sometimes called the braid relations.)
When $n = 2$, the affine symmetric group $\widetilde_2$ is the infinite dihedral group generated by two elements $s_0, s_1$ subject only to the relations $s_0^2 = s_1^2 = 1$.

These relations can be rewritten in the special form that defines the Coxeter groups, so the affine symmetric groups are Coxeter groups, with the $s_i$ as their Coxeter generating sets. For $n \geq 3$, the Coxeter–Dynkin diagram of $\widetilde_n$ is the -cycle, while for $n = 2$ it consists of two nodes joined by an edge labeled $\infty$. In these diagrams, the vertices represent the generators, which for Coxeter groups must be involutions. The edges of the cycle correspond to the relations between pairs of consecutive generators, while the absence of an edge between other pairs of generators indicates that they commute.

Geometric definition

In the Euclidean space $\R^$ with coordinates $(x_1, \ldots, x_n)$, the set of points for which $x_1 + x_2 + \ldots + x_n = 0$ forms a (hyper)plane, an -dimensional subspace. For every pair of distinct elements and of $\$ and every integer , the set of points in that satisfy $x_i - x_j = k$ forms an -dimensional subspace within , and there is a unique reflection of that fixes this subspace. Then the affine symmetric group can be realized geometrically as a collection of maps from to itself, the compositions of these reflections.

Inside , the subset of points with integer coordinates forms the ''root lattice'', . It is the set of all the integer vectors $(a_1, \ldots, a_n)$ such that $a_1 + \ldots + a_n = 0$. Each reflection preserves this lattice, and so the lattice is preserved by the whole group.

The fixed subspaces of these reflections divide into congruent simplices, called ''alcoves''. The situation when $n = 3$ is shown in the figure; in this case, the root lattice is a triangular lattice, with reflecting lines dividing it into equilateral triangle alcoves. However for higher dimensions, the alcoves are not regular simplices.

To translate between the geometric and algebraic definitions, one fixes an alcove and consider the hyperplanes that form its boundary. The reflections through these boundary hyperplanes may be identified with the Coxeter generators. In particular, there is a unique alcove (the ''fundamental alcove'') consisting of points $(x_1, \ldots, x_n)$ such that $x_1 \geq x_2 \geq \dots \geq x_n \geq x_1 - 1$, which is bounded by the hyperplanes $x_1 - x_2 = 0$, $x_2 - x_3 = 0$, ..., and $x_1 - x_n = 1$, illustrated in the case $n = 3$. For $i = 1, \ldots, n- 1$, one may identify the reflection through $x_i - x_ = 0$ with the Coxeter generator $s_i$, and also identify the reflection through $x_1 - x_n = 1$ with the generator $s_0 = s_n$.

Combinatorial definition

The elements of the affine symmetric group may be realized as a group of periodic permutations of the integers. In particular, say that a function $u \colon \Z \to \Z$ is an ''affine permutation'' if
*it is a bijection (each integer appears as the value of $u(x)$ for exactly one $x$),
*$u(x + n) = u(x) + n$ for all integers (the function is equivariant under shifting by $n$), and
*$u(1) + u(2) + \ldots + u(n) = 1 + 2 + \ldots + n$, the $n$th triangular number.
For every affine permutation, and more generally every shift-equivariant bijection, the numbers $u(1), \ldots, u(n)$ must all be distinct modulo . An affine permutation is uniquely determined by its ''window notation'' (1), \ldots, u(n)/math>, because all other values of $u$ can be found by shifting these values. Thus, affine permutations may also be identified with tuples (1), \ldots, u(n)/math> of integers that contain one element from each congruence class modulo and sum to $1 + 2 + \ldots + n$.

To translate between the combinatorial and algebraic definitions, for $i = 1, \ldots, n- 1$ one may identify the Coxeter generator $s_i$ with the affine permutation that has window notation , 2, \ldots, i - 1, i + 1, i, i + 2, \ldots, n , and also identify the generator $s_0 = s_n$ with the affine permutation , 2, 3, \ldots, n - 2, n - 1, n + 1. More generally, every reflection (that is, a conjugate of one of the Coxeter generators) can be described uniquely as follows: for distinct integers , in $\$ and arbitrary integer , it maps to , maps to , and fixes all inputs not congruent to or modulo .

Representation as matrices

Affine permutations can be represented as infinite periodic permutation matrices. If $u : \mathbb \to \mathbb$ is an affine permutation, the corresponding matrix has entry 1 at position $(i, u(i))$ in the infinite grid $\mathbb \times \mathbb$ for each integer , and all other entries are equal to 0. Since is a bijection, the resulting matrix contains exactly one 1 in every row and column. The periodicity condition on the map ensures that the entry at position $(a, b)$ is equal to the entry at position $(a + n, b + n)$ for every pair of integers $(a, b)$. For example, a portion of the matrix for the affine permutation , 0, 4\in \widetilde_3 is shown in the figure.

Relationship to the finite symmetric group

The affine symmetric group $\widetilde_n$ contains the finite symmetric group $S_n$ of permutations on $n$ elements as both a subgroup and a quotient group.

As a subgroup

There is a canonical way to choose a subgroup of $\widetilde_n$ that is isomorphic to the finite symmetric group $S_n$.
In terms of the algebraic definition, this is the subgroup of $\widetilde_n$ generated by $s_1, \ldots, s_$ (excluding the simple reflection $s_0 = s_n$). Geometrically, this corresponds to the subgroup of transformations that fix the origin, while combinatorially it corresponds to the window notations for which $\ = \$ (that is, in which the window notation is the one-line notation of a finite permutation).

If u = (1), u(2), \ldots, u(n)/math> is the window notation of an element of this standard copy of $S_n \subset \widetilde_n$, its action on the hyperplane in $\R^n$ is given by permutation of coordinates: $(x_1, x_2, \ldots, x_n) \cdot u = (x_, x_, \ldots, x_)$. (In this article, the geometric action of permutations and affine permutations is on the right; thus, if and are two affine permutations, the action of on a point is given by first applying , then applying .)

There are also many nonstandard copies of $S_n$ contained in $\widetilde_n$. A geometric construction is to pick any point in (that is, an integer vector whose coordinates sum to 0); the subgroup $(\widetilde_n)_a$ of $\widetilde_n$ of isometries that fix is isomorphic to $S_n$.

As a quotient

There is a simple map (technically, a surjective group homomorphism) from $\widetilde_n$ onto the finite symmetric group $S_n$. In terms of the combinatorial definition, an affine permutation can be mapped to a permutation by reducing the window entries modulo to elements of $\$, leaving the one-line notation of a permutation. In this article, the image $\pi(u)$ of an affine permutation is called the ''underlying permutation'' of .

The map sends the Coxeter generator s_0 = , 2, 3, 4, \ldots, n - 2, n - 1, n + 1/math> to the permutation whose one-line notation and cycle notation are , 2 , 3 , 4, \ldots , n - 2 , n - 1 , 1/math> and $(1 \; n)$, respectively.

The kernel of is by definition the set of affine permutations whose underlying permutation is the identity. The window notations of such affine permutations are of the form - a_1 \cdot n, 2 - a_2 \cdot n, \ldots, n - a_n \cdot n/math>, where $(a_1, a_2, \ldots, a_n)$ is an integer vector such that $a_1 + a_2 + \ldots + a_n = 0$, that is, where $(a_1, \ldots, a_n) \in \Lambda$. Geometrically, this kernel consists of the translations, the isometries that shift the entire space without rotating or reflecting it. In an abuse of notation, the symbol is used in this article for all three of these sets (integer vectors in , affine permutations with underlying permutation the identity, and translations); in all three settings, the natural group operation turns into an abelian group, generated freely by the vectors $\$.

Connection between the geometric and combinatorial definitions

The affine symmetric group $\widetilde_n$ has as a normal subgroup, and is isomorphic to the semidirect product
$\widetilde_n \cong S_n \ltimes \Lambda$
of this subgroup with the finite symmetric group $S_n$, where the action of $S_n$ on is by permutation of coordinates. Consequently, every element of $\widetilde_n$ has a unique realization as a product
$u = r \cdot t$ where $r$ is a permutation in the standard copy of $S_n$ in $\widetilde_n$ and $t$ is a translation in $\Lambda$.

This point of view allows for a direct translation between the combinatorial and geometric definitions of $\widetilde_n$: if one writes (1), \ldots, u(n)= _1 - a_1 \cdot n, \ldots, r_n - a_n \cdot n/math> where r = _1, \ldots, r_n= \pi(u) and $(a_1, a_2, \ldots, a_n) \in \Lambda$ then the affine permutation corresponds to the rigid motion of defined by
$(x_1, \ldots, x_n) \cdot u = \left(x_ + a_, \ldots, x_ + a_ \right).$

Furthermore, as with every affine Coxeter group, the affine symmetric group acts transitively and freely on the set of alcoves: for each two alcoves, a unique group element takes one alcove to the other. Hence, making an arbitrary choice of alcove $A_0$ places the group in one-to-one correspondence with the alcoves: the identity element corresponds to $A_0$, and every other group element corresponds to the alcove $A = A_0 \cdot g$ that is the image of $A_0$ under the action of .

Example:

Algebraically, $\widetilde_2$ is the infinite dihedral group, generated by two generators $s_0, s_1$ subject to the relations $s_0^2 = s_1^2 = 1$. Every other element of the group can be written as an alternating product of copies of $s_0$ and $s_1$.

Combinatorially, the affine permutation $s_1$ has window notation $$, 1/math>, corresponding to the bijection $2k \mapsto 2k - 1, 2k - 1 \mapsto 2k$ for every integer . The affine permutation $s_0$ has window notation $$, 3/math>, corresponding to the bijection $2k \mapsto 2k + 1, 2k + 1 \mapsto 2k$ for every integer . Other elements have the following window notations:
* \overbrace^ = + 2k, 2 - 2k
* \overbrace^ = - 2k, 2 + 2k
* \overbrace^ = + 2k, 1 - 2k
* \overbrace^ = - 2(k + 1), 1 + 2(k + 1)

Geometrically, the space on which $\widetilde_2$ acts is a line, with infinitely many equally spaced reflections. It is natural to identify the line with the real line $\R^1$, $s_0$ with reflection around the point , and $s_1$ with reflection around the point . In this case, the reflection $(s_0 s_1)^k s_0$ reflects across the point for any integer , the composition $s_0 s_1$ translates the line by , and the composition $s_1 s_0$ translates the line by .

Permutation statistics and permutation patterns

Many permutation statistics and other features of the combinatorics of finite permutations can be extended to the affine case.

Descents, length, and inversions

The ''length'' $\ell(g)$ of an element of a Coxeter group is the smallest number such that can be written as a product $g= s_ \cdots s_$ of Coxeter generators of .
Geometrically, the length of an element in $\widetilde_n$ is the number of reflecting hyperplanes that separate $A_0$ and $A_0 \cdot g$, where $A_0$ is the fundamental alcove (the simplex bounded by the reflecting hyperplanes of the Coxeter generators $s_0, s_1, \ldots, s_$).
Combinatorially, the length of an affine permutation is encoded in terms of an appropriate notion of inversions: for an affine permutation , the length is
$\ell(u) = \# \left\.$
Alternatively, it is the number of equivalence classes of pairs $(i, j) \in \mathbb \times \mathbb$ such that $i < j$ and $u(i) > u(j)$ under the equivalence relation $(i, j) \equiv (i', j')$ if $(i - i', j - j') = (kn, kn)$ for some integer .
The generating function for length in $\widetilde_n$ is
$\sum_ q^ = \frac.$

Similarly, there is an affine analogue of descents in permutations: an affine permutation has a descent in position if $u(i) > u(i + 1)$. (By periodicity, has a descent in position if and only if it has a descent in position $i + kn$ for all integers .)
Algebraically, the descents corresponds to the ''right descents'' in the sense of Coxeter groups; that is, is a descent of if and only if $\ell(u \cdot s_i) < \ell (u)$. The left descents (that is, those indices such that $\ell(s_i \cdot u) < \ell (u)$ are the descents of the inverse affine permutation $u^$; equivalently, they are the values such that occurs before in the sequence $\ldots, u(-2), u(-1), u(0), u(1), u(2), \ldots$.
Geometrically, is a descent of if and only if the fixed hyperplane of $s_i$ separates the alcoves $A_0$ and $A_0 \cdot u.$

Because there are only finitely many possibilities for the number of descents of an affine permutation, but infinitely many affine permutations, it is not possible to naively form a generating function for affine permutations by number of descents (an affine analogue of Eulerian polynomials). One possible resolution is to consider affine descents (equivalently, cyclic descents) in the finite symmetric group $S_n$. Another is to consider simultaneously the length and number of descents of an affine permutation. The generating function for these statistics over $\widetilde_n$ simultaneously for all is
\sum_ \frac \sum_ t^ q^
=
\left \frac
\right

where is the number of descents of the affine permutation and $\exp(x; q) = \sum_ \frac$ is the -exponential function.

Cycle type and reflection length

Any bijection $u : \mathbb \to \mathbb$ partitions the integers into a (possibly infinite) list of (possibly infinite) cycles: for each integer , the cycle containing is the sequence $( \ldots, u^(i), u^(i), i, u(i), u^2(i), \ldots )$ where exponentiation represents functional composition.
For an affine permutation , the following conditions are equivalent: all cycles of are finite, has finite order, and the geometric action of on the space has at least one fixed point.

The ''reflection length'' $\ell_R(u)$ of an element of $\widetilde_n$ is the smallest number such that there exist reflections $r_1, \ldots, r_k$ such that $u = r_1 \cdots r_k$. (In the symmetric group, reflections are transpositions, and the reflection length of a permutation is $n - c(u)$, where $c(u)$ is the number of cycles of .) In , the following formula was proved for the reflection length of an affine permutation : for each cycle of , define the ''weight'' to be the integer ''k'' such that consecutive entries congruent modulo differ by exactly . Form a tuple of cycle weights of (counting translates of the same cycle by multiples of only once), and define the ''nullity'' $\nu(u)$ to be the size of the smallest set partition of this tuple so that each part sums to 0. Then the reflection length of is
$\ell_R(u) = n - 2 \nu(u) + c(\pi(u)),$
where $\pi(u)$ is the underlying permutation of .

For every affine permutation , there is a choice of subgroup of $\widetilde_n$ such that $W \cong S_n$, $\widetilde_n = W \ltimes \Lambda$, and for the standard form $u = w \cdot t$ implied by this semidirect product, the reflection lengths are additive, that is, $\ell_R(u) = \ell_R(w) + \ell_R(t)$.

Fully commutative elements and pattern avoidance

A ''reduced word'' for an element of a Coxeter group is a tuple $(s_, \ldots, s_)$ of Coxeter generators of minimum possible length such that $g = s_ \cdots s_$. The element is called ''fully commutative'' if any reduced word can be transformed into any other by sequentially swapping pairs of factors that commute. For example, in the finite symmetric group $S_4$, the element $2143 = (12)(34)$ is fully commutative, since its two reduced words $(s_1, s_3)$ and $(s_3, s_1)$ can be connected by swapping commuting factors, but $4132 = (142)(3)$ is not fully commutative because there is no way to reach the reduced word $(s_3, s_2, s_3, s_1)$ starting from the reduced word $(s_2, s_3, s_2, s_1)$ by commutations.

proved that in the finite symmetric group $S_n$, a permutation is fully commutative if and only if it avoids the permutation pattern 321, that is, if and only if its one-line notation contains no three-term decreasing subsequence. In , this result was extended to affine permutations: an affine permutation is fully commutative if and only if there do not exist integers $i < j < k$ such that $u(i) > u(j) > u(k)$.

The number of affine permutations avoiding a single pattern is finite if and only if avoids the pattern 321, so in particular there are infinitely many fully commutative affine permutations. These were enumerated by length in .

Parabolic subgroups and other structures

The parabolic subgroups of $\widetilde_n$ and their coset representatives offer a rich combinatorial structure. Other aspects of the affine symmetric group, such as its Bruhat order and representation theory, may also be understood via combinatorial models.

Parabolic subgroups, coset representatives

A ''standard parabolic subgroup'' of a Coxeter group is a subgroup generated by a subset of its Coxeter generating set. The maximal parabolic subgroups are those that come from omitting a single Coxeter generator. In $\widetilde_n$, all maximal parabolic subgroups are isomorphic to the finite symmetric group $S_n$. The subgroup generated by the subset $\ \smallsetminus \$ consists of those affine permutations that stabilize the interval + 1, i + n/math>, that is, that map every element of this interval to another element of the interval.

For a fixed element of $\$, let $J = \ \smallsetminus \$ be the maximal proper subset of Coxeter generators omitting $s_i$, and let $(\widetilde_n)_J$ denote the parabolic subgroup generated by . Every coset $g \cdot (\widetilde_n)_J$ has a unique element of minimum length. The collection of such representatives, denoted $(\widetilde_n)^J$, consists of the following affine permutations:
$(\widetilde_n)^J = \left \.$

In the particular case that $J = \$, so that $(\widetilde_n)_J \cong S_n$ is the standard copy of $S_n$ inside $\widetilde_n$, the elements of $(\widetilde_n)^J \cong \widetilde_n/S_n$ may naturally be represented by ''abacus diagrams'': the integers are arranged in an infinite strip of width , increasing sequentially along rows and then from top to bottom; integers are circled if they lie directly above one of the window entries of the minimal coset representative. For example, the minimal coset representative u = 5, 0, 6, 9/math> is represented by the abacus diagram at right. To compute the length of the representative from the abacus diagram, one adds up the number of uncircled numbers that are smaller than the last circled entry in each column. (In the example shown, this gives $5 + 3 + 0 + 1 = 9$.)

Other combinatorial models of minimum-length coset representatives for $\widetilde_n/S_n$ can be given in terms of core partitions (integer partitions in which no hook length is divisible by ) or bounded partitions (integer partitions in which no part is larger than ). Under these correspondences, it can be shown that the weak Bruhat order on $\widetilde_n / S_n$ is isomorphic to a certain subposet of Young's lattice.

Bruhat order

The Bruhat order on $\widetilde_n$ has the following combinatorial realization. If is an affine permutation and and are integers, define
$u$, j
to be the number of integers such that $a \leq i$ and $u(a) \geq j$. (For example, with u = , 0, 4\in \widetilde_3, one has u 3, 1 = 3: the three relevant values are $a = 0, 1, 3$, which are respectively mapped by to 1, 2, and 4.) Then for two affine permutations , , one has that $u \leq v$ in Bruhat order if and only if $u$, j\leq v, j for all integers , .

Representation theory and an affine Robinson–Schensted correspondence

In the finite symmetric group, the Robinson–Schensted correspondence gives a bijection between the group and pairs $(P, Q)$ of standard Young tableaux of the same shape. This bijection plays a central role in the combinatorics and the representation theory of the symmetric group. For example, in the language of Kazhdan–Lusztig theory, two permutations lie in the same left cell if and only if their images under Robinson–Schensted have the same tableau , and in the same right cell if and only if their images have the same tableau . In , Jian-Yi Shi showed that left cells for $\widetilde_n$ are indexed instead by ''tabloids'', and in he gave an algorithm to compute the tabloid analogous to the tableau for an affine permutation. In , the authors extended Shi's work to give a bijective map between $\widetilde_n$ and triples $(P, Q, \rho)$ consisting of two tabloids of the same shape and an integer vector whose entries satisfy certain inequalities. Their procedure uses the matrix representation of affine permutations and generalizes the shadow construction, introduced in .

Inverse realizations

In some situations, one may wish to consider the action of the affine symmetric group on $\Z$ or on alcoves that is inverse to the one given above. We describe these alternate realizations now.

In the combinatorial action of $\widetilde_n$ on $\Z$, the generator $s_i$ acts by switching the ''values'' and . In the inverse action, it instead switches the entries in ''positions'' and . Similarly, the action of a general reflection will be to switch the entries at ''positions'' and for each , fixing all inputs at positions not congruent to or modulo .

In the geometric action of $\widetilde_n$, the generator $s_i$ acts on an alcove by reflecting it across one of the bounding planes of the fundamental alcove . In the inverse action, it instead reflects across one of ''its own'' bounding planes. From this perspective, a reduced word corresponds to an ''alcove walk'' on the tessellated space .As in, for example, , .

Relationship to other mathematical objects

The affine symmetric group is closely related to a variety of other mathematical objects.

Juggling patterns

In , a correspondence is given between affine permutations and juggling patterns encoded in a version of siteswap notation. Here, a juggling pattern of period is a sequence $(a_1, \ldots, a_n)$ of nonnegative integers (with certain restrictions) that captures the behavior of balls thrown by a juggler, where the number $a_i$ indicates the length of time the th throw spends in the air (equivalently, the height of the throw). The number of balls in the pattern is the average $b = \frac$. The Ehrenborg–Readdy correspondence associates to each juggling pattern $= (a_1, \ldots, a_n)$ of period the function $w_ \colon \Z \to \Z$ defined by
$w_(i) = i + a_i - b,$
where indices of the sequence a are taken modulo . Then $w_$ is an affine permutation in $\widetilde_n$, and moreover every affine permutation arises from a juggling pattern in this way. Under this bijection, the length of the affine permutation is encoded by a natural statistic in the juggling pattern:
$\ell(w_) = (b - 1)n - \operatorname(),$
where $\operatorname()$ is the number of crossings (up to periodicity) in the arc diagram of a. This allows an elementary proof of the generating function for affine permutations by length.

For example, the juggling pattern 441 has $n = 3$ and $b = \frac = 3$. Therefore, it corresponds to the affine permutation w_ = + 4 - 3, 2 + 4 - 3, 3 + 1 - 3= , 3, 1/math>. The juggling pattern has four crossings, and the affine permutation has length $\ell(w_) = (3 - 1) \cdot 3 - 4 = 2$.

Similar techniques can be used to derive the generating function for minimal coset representatives of $\widetilde_n/S_n$ by length.

Complex reflection groups

In a finite-dimensional real inner product space, a ''reflection'' is a linear transformation that fixes a linear hyperplane pointwise and negates the vector orthogonal to the plane. This notion may be extended to vector spaces over other fields. In particular, in a complex inner product space, a ''reflection'' is a unitary transformation of finite order that fixes a hyperplane. This implies that the vectors orthogonal to the hyperplane are eigenvectors of , and the associated eigenvalue is a complex root of unity. A ''complex reflection group'' is a finite group of linear transformations on a complex vector space generated by reflections.

The complex reflection groups were fully classified by : each complex reflection group is isomorphic to a product of irreducible complex reflection groups, and every irreducible either belongs to an infinite family $G(m, p, n)$ (where , , and are positive integers such that divides ) or is one of 34 other (so-called "exceptional") examples. The group $G(m, 1, n)$ is the generalized symmetric group: algebraically, it is the wreath product $(\Z / m \Z) \wr S_n$ of the cyclic group $\Z / m \Z$ with the symmetric group $S_n$. Concretely, the elements of the group may be represented by monomial matrices (matrices having one nonzero entry in every row and column) whose nonzero entries are all th roots of unity. The groups $G(m, p, n)$ are subgroups of $G(m, 1, n)$, and in particular the group $G(m, m, n)$ consists of those matrices in which the product of the nonzero entries is equal to 1.

In , Shi showed that the affine symmetric group is a ''generic cover'' of the family $\left\$, in the following sense: for every positive integer , there is a surjection $\pi_m$ from $\widetilde_n$ to $G(m, m, n)$, and these maps are compatible with the natural surjections $G(m, m, n) \twoheadrightarrow G(p, p, n)$ when $p \mid m$ that come from raising each entry to the th power. Moreover, these projections respect the reflection group structure, in that the image of every reflection in $\widetilde_n$ under $\pi_m$ is a reflection in $G(m, m, n)$; and similarly when $m > 1$ the image of the standard Coxeter element $s_0 \cdot s_1 \cdots s_$ in $\widetilde_n$ is a Coxeter element in $G(m, m, n)$.

Affine Lie algebras

Each affine Coxeter group is associated to an affine Lie algebra, a certain infinite-dimensional non-associative algebra with unusually nice representation-theoretic properties. In this association, the Coxeter group arises as a group of symmetries of the root space of the Lie algebra (the dual of the Cartan subalgebra). In the classification of affine Lie algebras, the one associated to $\widetilde_n$ is of (untwisted) type $A_^$, with Cartan matrix $\begin 2 & - 2 \\ - 2& 2 \end$ for $n = 2$ and
$\begin 2 & -1 & 0 & \cdots & 0 & -1 \\ -1 & 2 & -1 & \cdots & 0 & 0 \\ 0 & -1 & 2 & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & 2 & -1 \\ -1 & 0 & 0 & \cdots & -1 & 2 \end$
(a circulant matrix) for $n > 2$.

Like other Kac–Moody algebras, affine Lie algebras satisfy the Weyl–Kac character formula, which expresses the characters of the algebra in terms of their highest weights. In the case of affine Lie algebras, the resulting identities are equivalent to the Macdonald identities. In particular, for the affine Lie algebra of type $A_1^$, associated to the affine symmetric group $\widetilde_2$, the corresponding Macdonald identity is equivalent to the Jacobi triple product.

Extended affine symmetric group

The affine symmetric group is a subgroup of the ''extended affine symmetric group''. The extended group is isomorphic to the wreath product $\Z \wr S_n$. Its elements are ''extended affine permutations'': bijections $u \colon \Z \to \Z$ such that $u(x + n) = u(x) + n$ for all integers . Unlike the affine symmetric group, the extended affine symmetric group is not a Coxeter group. But it has a natural generating set that extends the Coxeter generating set for $\widetilde_n$: the ''shift operator'' $\tau$ whose window notation is \tau = , 3, \ldots, n, n + 1/math> generates the extended group with the simple reflections, subject to the additional relations $\tau s_i \tau^ = s_$.

Combinatorics of other affine Coxeter groups

The geometric action of the affine symmetric group $\widetilde_n$ places it naturally in the family of affine Coxeter groups, each of which has a similar geometric action on an affine space. The combinatorial description of the $\widetilde_n$ may also be extended to many of these groups: in , an axiomatic description is given of certain permutation groups acting on $\Z$ (the "George groups", in honor of George Lusztig), and it is shown that they are exactly the "classical" Coxeter groups of finite and affine types A, B, C, and D. (In the classification of affine Coxeter groups, the affine symmetric group is type A.) Thus, the combinatorial interpretations of descents, inversions, etc., carry over in these cases. Abacus models of minimum-length coset representatives for parabolic quotients have also been extended to this context.

History

The study of Coxeter groups in general could be said to first arise in the classification of regular polyhedra (the Platonic solids) in ancient Greece. The modern systematic study (connecting the algebraic and geometric definitions of finite and affine Coxeter groups) began in work of Coxeter in the 1930s. The combinatorial description of the affine symmetric group first appears in work of , and was expanded upon by .

References

Notes

Works cited

*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
* {{citation , contribution = Une forme géométrique de la correspondance de Robinson-Schensted , author-last = Viennot , author-first = G. , year = 1977 , title = Combinatoire et représentation du groupe symétrique , publisher = Springer , series = Lecture Notes in Mathematics , volume = 579 , language = fr, pages = 29–58 , editor-last = Foata , editor-first = Dominique , editor-link = Dominique Foata , doi = 10.1007/BFb0090011
, isbn = 978-3-540-08143-2

Coxeter groups
Reflection groups
Permutation groups
Symmetry
Representation theory