Computing closures of finitely generated subgroups of the free group (Q4942279)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1419260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing closures of finitely generated subgroups of the free group |
scientific article; zbMATH DE number 1419260 |
Statements
9 August 2000
0 references
pro-\(p\) topologies
0 references
profinite topologies
0 references
free groups
0 references
closures of finitely generated subgroups
0 references
reduced inverse automata
0 references
algorithms
0 references
prosolvable topologies
0 references
0.9431596
0 references
0.9213176
0 references
0.8923355
0 references
0 references
0.8905419
0 references
0.8902731
0 references
0.8887117
0 references
0.88795346
0 references
Computing closures of finitely generated subgroups of the free group (English)
0 references
Computing techniques for the closures of finitely generated subgroups of a free group in the pro-\(p\) and pronilpotent topologies are presented. The central idea is to use the bijective correspondence between these subgroups and reduced inverse automata. The paper is concluded with a brief discussion of the open question whether there is an algorithm to compute the closure of a finitely generated subgroup of a free group in the prosolvable topology. For the entire collection see [Zbl 0931.00032].
0 references
