Featured Article Summary #9

The affine symmetric groups describe the symmetries of the number line and the triangular tiling of the plane. They can also be defined as collections of periodic permutations or algebraically as a group with generators and relations. These groups are studied in combinatorics and representation theory. Each affine symmetric group is an infinite extension of a finite symmetric group and has similar combinatorial properties. They also have relationships with juggling patterns and complex reflection groups, and their properties extend to affine Coxeter groups. The affine symmetric group can be defined in two ways: as an abstract group with generators and relations, or using geometric and combinatorial models. The affine symmetric group is defined using generators and relations. When n is greater than or equal to 3, the generators satisfy certain equations. For n = 2, the affine symmetric group is the infinite dihedral group with specific relations. These groups can be represented using Coxeter–Dynkin diagrams. In the Euclidean space, a hyperplane is an (n-1)-dimensional subspace. The affine symmetric group can be thought of as a collection of reflections across these hyperplanes. The subset of points with integer coordinates forms the root lattice, which is preserved by the reflections. The reflections also divide the space into congruent simplices called alcoves. The affine symmetric group can be represented as a group of periodic permutations of the integers. An affine permutation is determined by its window notation and can also be identified with tuples of integers. Reflections can be described using specific mappings of integers.