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-20130617T072832Z-2231-25763@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20130621T150000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20130621T170000
CLASS:PUBLIC
CREATED:20130617T072832Z
DESCRIPTION:This week the seminar will consist of three 20 minute talks\,
starting at 3pm Friday 21st of June in Blakers Lecture Theatre.\n\n--Talk
1--\n\nMark Ioppolo\n\nwill speak on\n\nSymmetry in coding theory: Constru
cting error control codes with group theory\n\nAbstract:\n\nWhen data is t
ransmitted over a noisy communication channel there is a possibility that
the received message will be different to what the sender intended. A freq
uently made assumption in coding theory is that the probability of an erro
r occurring does not depend on the position of the error in the codeword\,
or on the value of the error. The group theoretic analogue of this assump
tion is known as neighbour-transitivity. This talk will introduce the stud
y of neighbour-transitive codes\, focusing on the case where the automorph
ism group of the code in question is contained in a group of symplectic ma
trices.\n\n--Talk 2--\n\nDavid Raithel\n\nwill speak on\n\nStructures of S
ymmetries\n\nAbstract:\n\nPermutation groups are the tools with which we u
nderstand and study symmetry. For over a century\, mathematicians have bee
n endeavouring to classify classes of permutation groups\, which in turn c
lassifies classes of symmetries. Transitive groups lie at the heart of per
mutation groups\, and one of the large overarching themes of permutation g
roup theory has been to characterise transitive groups. In this talk I sha
ll outline four major structure theorems from as early as 1911 to as recen
tly as 2004. These theorems have proven to be powerful tools which have al
lowed group theorists to sledgehammer their way through some otherwise ins
urmountable problems.\n\n--Talk 3--\n\nDaniel Hawtin\n\nwill speak on\n\nA
ffine Elusive Codes\n\nAbstract:\n\nAn Elusive pair $(C\,X)$ is a code-gro
up pair where $X$ fixes the neighbour set setwise\, and contains an automo
rphism which does not fix $C$ setwise. This implies that there are multipl
e codes\, each with the same neighbour set. The concept was introduced by
Gillespie and Praeger in order to discern the correct definition for neigh
bour transitive codes. We discuss a family of exmples which are as large a
s possible\, in some sense\, and display properties which previous example
s have not.\n\nSpeakers: Mark Ioppolo\, David Raithel\, and Daniel Hawtin
DTSTAMP:20130617T072832Z
LAST-MODIFIED:20130618T002255Z
LOCATION:Blakers Lecture Theatre
ORGANIZER;CN=Irene Pivotto:MAILTO:irene.pivotto@uwa.edu.au
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar
URL:https://events.uwa.edu.au/event/20130617T072832Z-2231-25763@events.uwa.
edu.au/whatson/CMSC
END:VEVENT
END:VCALENDAR