BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:UWA Whatson 2002
X-WR-CALNAME;VALUE=TEXT:What's On At UWA
X-WR-TIMEZONE;VALUE=TEXT:Australia/Perth
VERSION:2.0
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:/softwarestudio.org/Olson_20011030_5/Australia/Perth
X-LIC-LOCATION:Australia/Perth
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:WST
DTSTART:19700101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:P-20130225T085057Z-2231-3334@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20130301T150000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20130301T160000
CLASS:PUBLIC
CREATED:20130225T085057Z
DESCRIPTION:Abstract:\n\nIn 1961 G.E. Wall conjectured that the number of
maximal subgroups of a finite group is less than the order of the group. T
he conjecture holds for all finite solvable groups (proved by Wall himself
in his original paper) and holds for almost all finite simple groups\, po
ssibly all of them (proved by Liebeck\, Pyber and Shalev in 2007). It is n
ow known to be false in general\, at least as originally stated\, with inf
initely many negative composite group examples found through a combination
of computational and theoretical techniques. (I cite in particular comput
er calculations of Frank Luebeck\, as partly inspired and later confirmed
by calculations of my undergraduate student\, Tim Sprowl\, with theoretica
l input from myself and Bob Guralnick.) In this talk I will try to discu
ss the ingredients in this quite remarkable story\, and I will mention as
much of the legacy of positive consequences as time permits.\n\nSpeakers:
Leonard Scott
DTSTAMP:20130225T085057Z
LAST-MODIFIED:20130301T033631Z
LOCATION:MLR2
ORGANIZER;CN=Irene Pivotto:MAILTO:irene.pivotto@uwa.edu.au
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar\, The Wall and Guralnick conjectu
res: history and legacy
URL:https://events.uwa.edu.au/event/20130225T085057Z-2231-3334@events.uwa.e
du.au/whatson/CMSC
END:VEVENT
END:VCALENDAR