Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.-C. Birget, S. Margolis, J. Meakin, and P. Weil, PSPACE-completeness of certain algorithmic problems on the subgroups of free groups, in Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP94), S. Abiteboul and E. Shamir, eds., Lecture Notes in Comput. Sci. 820, Springer-Verlag, Berlin, New York, Heidelberg, 1994, 274–285; Theoret. Comput. Sci., to appear.
M. Hall, Jr., A topology for free groups and related groups, Ann. Math., 52 (1950), 127–139.
R.C. Lyndon and P.E. Schupp, Combinatorial Group Theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 89, Springer-Verlag, Berlin, 1977.
S. Margolis and J. Meakin, Free inverse monoids and graph immersions, Internat. J. Algebra Comput., 3 (1993), 79–100.
S. Margolis, M. Sapir, and P. Weil, Closed subgroups in pro-p topologies and the extension problem for inverse automata, to appear.
L. Ribes and P.A. Zalesskii, The pro-p topology of a free group and algorithmic problems in semigroups, Internat. J. Algebra Comput., 4 (1994), 359–374.
J. Rotman, An introduction to the Theory of Groups, 4th edition, Springer-Verlag, New York, 1995.
J. Stallings, The topology of graphs, Invent. Math., 71 (1983), 551–565.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this paper
Cite this paper
Weil, P. (2000). Computing Closures of Finitely Generated Subgroups of the Free Group. In: Birget, JC., Margolis, S., Meakin, J., Sapir, M. (eds) Algorithmic Problems in Groups and Semigroups. Trends in Mathematics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1388-8_16
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1388-8_16
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7126-0
Online ISBN: 978-1-4612-1388-8
eBook Packages: Springer Book Archive