A simple undecidable problem for free groups




Harju Tero

PublisherElsevier

2024

Theoretical Computer Science

Theoretical Computer Science

114629

1003

0304-3975

1879-2294

DOIhttps://doi.org/10.1016/j.tcs.2024.114629(external)

https://doi.org/10.1016/j.tcs.2024.114629(external)

https://research.utu.fi/converis/portal/detail/Publication/404690265(external)



Let Fn denote the free group on n generators. It is shown to be undecidable for two morphisms g,h:Fn→F2 and a generator element a of F2, whether or not there exists an element w∈Fn such that g(w)=a and h(w)=1, where 1 is the identity element.

Last updated on 2024-26-11 at 11:53