Decision problems concerning surjections and embeddings of groups
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Jonathan Nelson.
The isomorphism problem, of deciding if two presentations define isomorphic groups, has been shown to be algorithmically impossible for finitely presented groups. However, if we start with two finite presentations P and Q which define isomorphic groups, then we can algorithmically construct an explicit isomorphism between them. Moreover, we can algorithmically enumerate all finite presentations of groups isomorphic to a given group.
In this talk I will discuss variations of these ideas, when we replace the word “isomorphic” with “surjects onto” or “embeds into”, giving existing results as well as some of my own recent work.
This talk is part of the Junior Algebra/Logic/Number Theory seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
