Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

6: Permutation and Dihedral Groups

( \newcommand{\kernel}{\mathrm{null}\,}\)

We have already been introduced to two important classes of nonabelian groups: namely, the matrix groups GL(n,R) and SL(n,R) for n2. We now consider a more general class of (mostly) nonabelian groups: permutation groups.

  • 6.1: Introduction to Permutation Groups
    In this section, we will introduce permutation groups and define permutation multiplication.
  • 6.2: Symmetric Groups
    In this section, we will discuss symmetric groups and cycle notation, as well as provide the definition and examples of disjoint cycles.
  • 6.3: Alternating Groups
    In this section, we will discuss alternating groups and corresponding theorems.
  • 6.4: Cayley's Theorem
    One might wonder how “common” permutation groups are in math. They are, it turns out, ubiquitous in abstract algebra: in fact, every group can be thought of as a group of permutations! We will prove this, but we first need to start with a lemma.
  • 6.5: Dihedral Groups
    Dihedral groups are groups of symmetries of regular n-gons. We will start with an example.
  • 6.6: Exercises
    This page contains the exercises for Chapter 6.


This page titled 6: Permutation and Dihedral Groups is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Jessica K. Sklar via source content that was edited to the style and standards of the LibreTexts platform.

  • Was this article helpful?

Support Center

How can we help?