Goto Chapter: Top 1 2 3 4 Bib Ind
 [Top of Book]  [Contents]   [Next Chapter] 

LINS

provides an algorithm for computing the normal subgroups of a finitely presented group up to some given index bound.

0.9

15 March 2024

Friedrich Rober
Email: friedrich.rober@rwth-aachen.de

Contents

1 Introduction
 1.1 Overview
 1.2 Examples

  1.2-1 Example : all normal subgroups up to index \(n\)
  1.2-2 Example : all normal subgroups of index \(n\)
 1.3 Main Functions

  1.3-1 LowIndexNormalSubs
2 LINS Interface
 2.1 LINS Graph

  2.1-1 List
  2.1-2 ComputedNormalSubgroups
  2.1-3 LinsRoot
  2.1-4 IndexBound
  2.1-5 LinsOptions
  2.1-6 IsomorphismFpGroup
 2.2 LINS Node

  2.2-1 Grp
  2.2-2 Index
  2.2-3 LinsNodeMinimalSupergroups
  2.2-4 LinsNodeMinimalSubgroups
  2.2-5 LinsNodeSupergroups
  2.2-6 LinsNodeSubgroups
 2.3 LINS Search Functions

  2.3-1 LowIndexNormalSubgroupsSearch
  2.3-2 LowIndexNormalSubgroupsSearchForAll
  2.3-3 LowIndexNormalSubgroupsSearchForIndex
 2.4 Examples

  2.4-1 Revised Example : all normal subgroups up to index \(n\)
  2.4-2 Revised Example : all normal subgroups of index \(n\)
  2.4-3 Example : a normal subgroup of index \(n\)
3 LINS Search
 3.1 LINS Search Options
4 License
References
Index

 [Top of Book]  [Contents]   [Next Chapter] 
Goto Chapter: Top 1 2 3 4 Bib Ind

generated by GAPDoc2HTML