SEMINAR: Groups and Combinatorics Seminar: Algorithmic Generalisations of Small Cancellation Theory
|
|
Groups and Combinatorics Seminar: Algorithmic Generalisations of Small Cancellation Theory |
Other events...
|
Groups and Combinatorics Seminar
-------------------------------------------------
Max Neunhöffer
(University of St Andrews)
"Algorithmic Generalisations of Small Cancellation Theory"
Friday 9th September (2011), 1pm, MLR2
Abstract:
In this talk I will report on joint work in progress with Stephen
Linton, Richard Parker and Colva Roney-Dougal. We want to generalise
classical small cancellation theory (SCT) in an algorithmic direction.
SCT used to be a fixed set of conditions to test on a finite
presentation of a group. If these conditions are fulfilled, SCT proves
that the group is infinite, word-hyperbolic and provides a solution to
the word problem.
I will describe our ideas to generalise this beyond recognition.
In the end, the computer will analyse a finite presentation of a group
or other algebraic structure and come up with a SCT-like proof showing
that the algebraic structure is infinite and providing a solution to
the word problem.
Speaker(s) |
Max Neunh�ffer
|
Location |
Maths Lecture Room 2
|
|
Contact |
Michael Giudici
<[email protected]>
|
Start |
Fri, 09 Sep 2011 13:00
|
End |
Fri, 09 Sep 2011 13:45
|
Submitted by |
Michael Giudici <[email protected]>
|
Last Updated |
Mon, 12 Sep 2011 11:49
|
Included in the following Calendars: |
|
- Locations of venues on the Crawley and Nedlands campuses are
available via the Campus Maps website.
- Download this event as:
Text |
iCalendar
-
Mail this event:
|