Decision problems concerning surjections and embeddings of groups
- π€ Speaker: Maurice Chiodo
- π Date & Time: Friday 25 November 2011, 14:00 - 15:00
- π Venue: MR4
Abstract
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.
Series This talk is part of the Junior Algebra and Number Theory seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- Junior Algebra and Number Theory seminar
- MR4
- ndb35's list
- School of Physical Sciences
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Friday 25 November 2011, 14:00-15:00