Computing closures of finitely generated subgroups of the free group
From MaRDI portal
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].
Recommendations
- Computing fixed closures in free groups.
- Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups
- scientific article; zbMATH DE number 1014823
- On Closed Subgroups of Free Products of Profinite Groups
- scientific article; zbMATH DE number 4190013
- On free decompositions of verbally closed subgroups in free products of finite groups
- A remark on finitely generated subgroups of free groups
- Verbally closed subgroups of free solvable groups
- Algebraic and definable closure in free groups
- On products of closed subsets in free groups
Cited in
(9)- Generic properties of subgroups of free groups and finite presentations
- On finite-index extensions of subgroups of free groups.
- scientific article; zbMATH DE number 3959779 (Why is no real title available?)
- A Conjecture on the Hall Topology for the Free Group
- The geometry of profinite graphs with applications to free groups and finite monoids
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- The pro-nilpotent group topology on a free group
- Abelian kernels, profinite topologies and the extension problem
- Computing fixed closures in free groups.
This page was built for publication: Computing closures of finitely generated subgroups of the free group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942279)
