Advertisement

Groups Operating on a Set: Nomenclature, Examples, Applications

Chapter
  • 998 Downloads
Part of the Problem Books in Mathematics book series (PBM)

Abstract

Let X be a set; we denote by S X the set of all bijections (permutations) f: XX 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Marcel Berger 1984

Authors and Affiliations

  1. 1.U.E.R. de Mathematique et InformatiqueUniversité Paris VIIParis, Cedex 05France
  2. 2.Centre National de la Recherche ScientifiqueParisFrance
  3. 3.P.U.K.GrenobleFrance

Personalised recommendations