  
  
                                     [1X FGA [101X
  
  
                            [1X Free Group Algorithms [101X
  
  
                                     1.5.0
  
  
                                  4 April 2023
  
  
                               Christian Sievers
  
  
  
            [33X[0;10Y[13XNote:[113X This version of FGA is a fork of the original FGA,
            maintained by the GAP Team.[133X
  
  
  
  Christian Sievers
      Email:    [7Xmailto:c.sievers@tu-bs.de[107X
  
  -------------------------------------------------------
  
  
  [1XContents (FGA)[101X
  
  1 [33X[0;0YIntroduction[133X
    1.1 [33X[0;0YOverview[133X
    1.2 [33X[0;0YImplementation and background[133X
    1.3 [33X[0;0YIntegration of the package[133X
    1.4 [33X[0;0YLicense[133X
  2 [33X[0;0YFunctionality of the FGA package[133X
    2.1 [33X[0;0YNew operations for free groups[133X
      2.1-1 FreeGeneratorsOfGroup
      2.1-2 RankOfFreeGroup
      2.1-3 CyclicallyReducedWord
    2.2 [33X[0;0YMethod installations[133X
      2.2-1 Normalizer
      2.2-2 RepresentativeAction
      2.2-3 Centralizer
      2.2-4 Index
      2.2-5 Intersection
      2.2-6 \in
      2.2-7 IsSubgroup
      2.2-8 \=
      2.2-9 MinimalGeneratingSet
    2.3 [33X[0;0YConstructive membership test[133X
      2.3-1 AsWordLetterRepInGenerators
    2.4 [33X[0;0YAutomorphism groups of free groups[133X
      2.4-1 AutomorphismGroup
      2.4-2 IsomorphismFpGroup
      2.4-3 FreeGroupEndomorphismByImages
      2.4-4 FreeGroupAutomorphismsGeneratorO
  3 [33X[0;0YInstalling and loading the FGA package[133X
    3.1 [33X[0;0YInstalling the FGA package[133X
    3.2 [33X[0;0YLoading the FGA package[133X
  
  
  [32X
