Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

A condition equivalent to the solvability of the endomorphism problem for free groups


Author: Charles C. Edmunds
Journal: Proc. Amer. Math. Soc. 76 (1979), 23-24
MSC: Primary 20F10
DOI: https://doi.org/10.1090/S0002-9939-1979-0534382-6
MathSciNet review: 534382
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: To solve the endomorphism problem for a word W involving n generators of a free group F, it suffices to solve the problem assuming that the images of W involve no more than n generators.


References [Enhancements On Off] (What's this?)

  • [1] C. C. Edmunds, On the endomorphism problem for free groups. II, Proc. London Math. Soc. 38 (1979), 153-168. MR 520977 (80d:20025)
  • [2] P. E. Schupp, On the substitution problem for free groups, Proc. Amer. Math. Soc. 23 (1969), 421-424. MR 0245657 (39:6963)
  • [3] J. H. C. Whitehead, On certain sets of elements in a free group, Proc. London Math. Soc. 41 (1936), 48-56.

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 20F10

Retrieve articles in all journals with MSC: 20F10


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1979-0534382-6
Keywords: Free group, endomorphism, decision problem
Article copyright: © Copyright 1979 American Mathematical Society

American Mathematical Society