calculations of dihedral groups using circular indexation

In this work, a regular polygon with n sides is described by a periodic (circular) sequence with period n. each element of the sequence represents a vertex of the polygon. each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis. here each symmetry is considered as a system that takes an input circular sequence and generates a processed circular output sequence. the system can be described by a permutation function. permutation functions can be written in a simple form using circular indexation. the operation between the symmetries of the polygon is reduced to the composition of permutation functions, which in turn is easily implemented using periodic sequences. it is also shown that each symmetry is effectively a pure rotation or a pure flip. it is also explained how to synthesize each symmetry using two generating symmetries: time-reversal (flipping around a fixed symmetry axis) and unit-delay (rotation around the center-point by 2π /n radians clockwise).