In abstract algebra, the symmetric group Sn on a finite set of n symbols is the group whose elements are all the permutation operations that can be performed on n distinct symbols, and whose group operation is the composition of such permutation operations, which are defined as bijective functions from the set of symbols to itself.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| differentFrom | |
| rdfs:seeAlso | |
| foaf:depiction | |
| thumbnail | |
| is differentFrom of | |
| is rdfs:seeAlso of |