Groups Operating on a Set: Nomenclature, Examples, Applications
- 998 Downloads
Let X be a set; we denote by S X the set of all bijections (permutations) f: X → X from X into itself, and we endow S X with the law of composition given by (f, g) ↦ f ° g. Thus S X becomes a group, called the permutation group or symmetric group of X.
Unable to display preview. Download preview PDF.