A simple undecidable problem for free groups

dc.contributor.authorHarju Tero
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id404690265
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/404690265
dc.date.accessioned2025-08-27T21:37:26Z
dc.date.available2025-08-27T21:37:26Z
dc.description.abstractLet 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.
dc.identifier.eissn1879-2294
dc.identifier.jour-issn0304-3975
dc.identifier.olddbid200755
dc.identifier.oldhandle10024/183782
dc.identifier.urihttps://www.utupub.fi/handle/11111/47114
dc.identifier.urlhttps://doi.org/10.1016/j.tcs.2024.114629
dc.identifier.urnURN:NBN:fi-fe2025082789226
dc.language.isoen
dc.okm.affiliatedauthorHarju, Tero
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherElsevier
dc.publisher.countryNetherlandsen_GB
dc.publisher.countryAlankomaatfi_FI
dc.publisher.country-codeNL
dc.relation.articlenumber114629
dc.relation.doi10.1016/j.tcs.2024.114629
dc.relation.ispartofjournalTheoretical Computer Science
dc.relation.volume1003
dc.source.identifierhttps://www.utupub.fi/handle/10024/183782
dc.titleA simple undecidable problem for free groups
dc.year.issued2024

Tiedostot

Näytetään 1 - 1 / 1
Ladataan...
Name:
1-s2.0-S0304397524002445-main.pdf
Size:
342.63 KB
Format:
Adobe Portable Document Format