Article contents
On an algorithm to decide whether a free group is a free factor of another
Published online by Cambridge University Press: 20 December 2007
Abstract
We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F. We show that the latter dependency can be made exponential in the rank difference rank(F) - rank(H), which often makes a significant change.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2007
References
- 4
- Cited by