Anzeige
Erschienen in:
2000 | OriginalPaper | Buchkapitel
Computing Closures of Finitely Generated Subgroups of the Free Group
verfasst von : Pascal Weil
Erschienen in: Algorithmic Problems in Groups and Semigroups
Verlag: Birkhäuser Boston
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The aim of this paper is to present computing techniques for the finitely generated subgroups of the free group. The focus is the computation of the closures of a finitely generated subgroup for certain profinite topologies, namely the pro-p and the pro-nilpotent topology. However the first section concentrates on the classical manipulation of finitely generated subgroups when more elementary operations are concerned: computing the rank, the index or a basis; calculating an intersection.