Decision problems concerning surjections and embeddings of groups

Add to your list(s) Download to your calendar using vCal

• Maurice Chiodo
• Friday 25 November 2011, 14:00-15:00
• MR4.

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 and Number Theory seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• Junior Algebra and Number Theory seminar
• MR4
• School of Physical Sciences
• bld31
• ndb35's list

Note that ex-directory lists are not shown.