  
  
                                    [1X lpres [101X
  
  
                  [1X Nilpotent Quotients of L-Presented Groups [101X
  
  
                                     1.0.3
  
  
                                 20 March 2022
  
  
                                  René Hartung
  
  
  
  
  -------------------------------------------------------
  
  
  [1XContents (lpres)[101X
  
  1 [33X[0;0YThe [5Xlpres[105X package[133X
    1.1 [33X[0;0YIntroduction[133X
  2 [33X[0;0YAn Introduction to L-presented groups[133X
    2.1 [33X[0;0YDefinitions[133X
    2.2 [33X[0;0YCreating an L-presented group[133X
      2.2-1 LPresentedGroup
      2.2-2 ExamplesOfLPresentations
      2.2-3 FreeEngelGroup
      2.2-4 FreeBurnsideGroup
      2.2-5 FreeNilpotentGroup
      2.2-6 GeneralizedFabrykowskiGuptaLpGroup
      2.2-7 LamplighterGroup
      2.2-8 EmbeddingOfIASubgroup
    2.3 [33X[0;0YThe underlying free group[133X
      2.3-1 FreeGroupOfLpGroup
      2.3-2 FreeGeneratorsOfLpGroup
      2.3-3 GeneratorsOfGroup
      2.3-4 UnderlyingElement
      2.3-5 ElementOfLpGroup
    2.4 [33X[0;0YAccessing an L-presentation[133X
      2.4-1 FixedRelatorsOfLpGroup
      2.4-2 IteratedRelatorsOfLpGroup
      2.4-3 EndomorphismsOfLpGroup
    2.5 [33X[0;0YAttributes and properties of L-presented groups[133X
      2.5-1 UnderlyingAscendingLPresentation
      2.5-2 UnderlyingInvariantLPresentation
      2.5-3 IsAscendingLPresentation
      2.5-4 IsInvariantLPresentation
      2.5-5 EmbeddingOfAscendingSubgroup
    2.6 [33X[0;0YMethods for L-presented groups[133X
      2.6-1 EpimorphismFromFpGroup
      2.6-2 SplitExtensionByAutomorphismsLpGroup
      2.6-3 AsLpGroup
      2.6-4 IsomorphismLpGroup
  3 [33X[0;0YNilpotent Quotients of L-presented groups[133X
    3.1 [33X[0;0YNew methods for L-presented groups[133X
      3.1-1 NilpotentQuotient
      3.1-2 LargestNilpotentQuotient
      3.1-3 NqEpimorphismNilpotentQuotient
      3.1-4 AbelianInvariants
    3.2 [33X[0;0YA brief description of the algorithm[133X
    3.3 [33X[0;0YNilpotent Quotient Systems for invariant L-presentations[133X
      3.3-1 InitQuotientSystem
      3.3-2 ExtendQuotientSystem
    3.4 [33X[0;0YAttributes of L-presented groups related with the nilpotent quotient
    algorithm[133X
      3.4-1 NilpotentQuotientSystem
      3.4-2 NilpotentQuotients
    3.5 [33X[0;0YThe Info-Class InfoLPRES[133X
      3.5-1 InfoLPRES
      3.5-2 InfoLPRES_MAX_GENS
  4 [33X[0;0YSubgroups of L-presented groups[133X
    4.1 [33X[0;0YCreating a subgroup of an L-presented group[133X
      4.1-1 Subgroup
      4.1-2 SubgroupLpGroupByCosetTable
    4.2 [33X[0;0YComputing the index of finite-index subgroups[133X
      4.2-1 IndexInWholeGroup
      4.2-2 Index
      4.2-3 CosetTableInWholeGroup
    4.3 [33X[0;0YTechnical details[133X
      4.3-1 LPRES_TCSTART
      4.3-2 LPRES_CosetEnumerator
  5 [33X[0;0YApproximating the Schur multiplier[133X
    5.1 [33X[0;0YMethods[133X
      5.1-1 GeneratingSetOfMultiplier
      5.1-2 FiniteRankSchurMultiplier
      5.1-3 EndomorphismsOfFRSchurMultiplier
      5.1-4 EpimorphismCoveringGroups
      5.1-5 EpimorphismFiniteRankSchurMultiplier
      5.1-6 ImageInFiniteRankSchurMultiplier
  6 [33X[0;0YOn a parallel nilpotent quotient algorithm[133X
    6.1 [33X[0;0YUsage[133X
  
  
  [32X
