BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:UWA Whatson
X-WR-CALNAME;VALUE=TEXT:What's On At UWA
X-WR-TIMEZONE;VALUE=TEXT:Australia/Perth
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:/softwarestudio.org/Olson_20010626_2/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-20180507T021331Z-3080-23341@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180511T160000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180511T170000
CLASS:PUBLIC
CREATED:20180507T021331Z
DESCRIPTION:Speaker: Daniel Harvey (University of Western Australia)\n\nTi
tle: A cycle of maximum order in a graph of high minimum degree has a chor
d\n\nTime and place: 4pm 11 May 2018\, Weatherburn LT\n\nAbstract: A long
standing conjecture of Thomassen states that every cycle of maximum order
in a 3-connected graph contains a chord. While many partial results toward
s this conjecture have been obtained\, the conjecture itself remains unsol
ved. In this talk\, we shall discuss a result for graphs of high minimum d
egree\, which shows Thomassen's conjecture holds in that case. This result
holds for all graphs with high minimum degree\, rather than just 3-connec
ted graphs\, and this result is within a constant factor of best possible
when no assumption is made on the connectivity.\n\nPast and future seminar
s may be found at\nhttp://www.maths.uwa.edu.au/~glasby/GroupsAndCombinator
icsSeminar/S18.html\n\nThere will be cake in the Mathematics and Statisti
cs tea room at 15:40. The seminar starts at 16:00\, and after 17:05 we go
to the UniClub for a drink. \n\nAll welcome.
DTSTAMP:20180507T021331Z
LAST-MODIFIED:20180507T045700Z
ORGANIZER;CN=Stephen Glasby:MAILTO:glasbys@gmail.com
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar: Daniel Harvey\, 4pm Friday 11 Ma
y 2018 in Weatherburn LT
URL:http://events.uwa.edu.au/event/20180507T021331Z-3080-23341@events.uwa.
edu.au/whatson/CMSC
END:VEVENT
BEGIN:VEVENT
UID:P-20180507T061759Z-3291-533@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180517T160000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180517T170000
CLASS:PUBLIC
CREATED:20180507T061759Z
DESCRIPTION:Abstract: There is a striking connection between the zeroes of
the Riemann zeta-function and the distribution of the primes. In this ta
lk I shall mention some analytic properties of the zeta-function that when
known explicitly enable one to estimate\, very accurately\, the size of t
he n-th prime number.\n\nSpeakers: Dr Timothy Trudgian
DTSTAMP:20180507T061759Z
LAST-MODIFIED:20180508T013106Z
LOCATION:Blakers LT
ORGANIZER;CN=Brendan Florio:MAILTO:brendan.florio@uwa.edu.au
SEQUENCE:2
SUMMARY:Mathematics and Statistics Colloquium : How big is the n-th prime?
URL:http://events.uwa.edu.au/event/20180507T061759Z-3291-533@events.uwa.ed
u.au/whatson/CMSC
END:VEVENT
BEGIN:VEVENT
UID:P-20180514T070825Z-3080-1572@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180518T160000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180518T170000
CLASS:PUBLIC
CREATED:20180514T070825Z
DESCRIPTION:Speaker: Carmen Amarra (University of Western Australia and Un
iversity of the Philippines)\n\nTitle: Quotient-complete arc-transitive la
tin square graphs\n\nTime and place: 4pm 18 May 2018\, Weatherburn LT\n\nA
bstract: This talk deals with an open problem in my PhD thesis\, which inv
estigated arc-transitive diameter two graphs. In that thesis\, via normal
quotient reduction\, we identified two main families of such graphs\, name
ly vertex-quasiprimitive graphs and the so-called quotient-complete graphs
. The focus of this talk is the quotient-complete case with at most two co
mplete normal quotients\, and the aim is to find an infinite family of exa
mples that fall under this case. In particular we consider latin square gr
aphs corresponding to the Cayley table of finite groups.\n\nPast and futur
e seminars may be found at\nhttp://www.maths.uwa.edu.au/~glasby/GroupsAndC
ombinatoricsSeminar/S18.html\n\nThere will be cake in the Mathematics an
d Statistics tea room at 15:40. The seminar starts at 16:00\, and after
17:05 we go to the UniClub for a drink. \n\nAll welcome.
DTSTAMP:20180514T070825Z
LAST-MODIFIED:20180515T014911Z
ORGANIZER;CN=Stephen Glasby:MAILTO:glasbys@gmail.com
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar: Carmen Amarra\, 4pm Friday 18 Ma
y 2018 in Weatherburn LT
URL:http://events.uwa.edu.au/event/20180514T070825Z-3080-1572@events.uwa.e
du.au/whatson/CMSC
END:VEVENT
BEGIN:VEVENT
UID:P-20180519T032858Z-3080-24027@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180525T160000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180525T170000
CLASS:PUBLIC
CREATED:20180519T032858Z
DESCRIPTION:Speaker: Emilio Pierro (University of Western Australia)\n\nTi
tle: Finite simple quotients of mapping class groups\n\nTime and place: 4p
m Friday 25 May 2018\, Weatherburn LT\n\nAbstract: A natural approach to s
tudying an infinite group is to try to understand its finite quotients (or
non-quotients). We discuss the introduction of some new techniques to det
ermine non-quotients in the particular case of the surface mapping class g
roups\, however they apply much more generally. This is joint work with Da
wid Kielak.\n\nPast and future seminars may be found at\nhttp://www.maths.
uwa.edu.au/~glasby/GroupsAndCombinatoricsSeminar/S18.html\n\nThere will be
cake in the Mathematics and Statistics tea room at 15:40. The seminar st
arts at 16:00\, and after 17:05 we go to the UniClub for a drink. \n\nAl
l welcome.
DTSTAMP:20180519T032858Z
LAST-MODIFIED:20180521T030006Z
ORGANIZER;CN=Stephen Glasby:MAILTO:glasbys@gmail.com
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar: Emilio Pierro\, 4pm Friday 25 Ma
y 2018\, Weatherburn
URL:http://events.uwa.edu.au/event/20180519T032858Z-3080-24027@events.uwa.
edu.au/whatson/CMSC
END:VEVENT
BEGIN:VEVENT
UID:P-20180611T051443Z-3080-8534@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180615T160000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180615T170000
CLASS:PUBLIC
CREATED:20180611T051444Z
DESCRIPTION:Speaker: Luke Morgan (Univ. of Western Australia)\n\nTitle: Th
e Distinguishing Number of Finite Permutation Groups\n\nTime and place: 4p
m Friday 15 Jun 2018\, Robert Street LT (note unusual venue)\n\nAbstract:
The distinguishing number of a permutation group G acting on a set X is th
e smallest size of a partition of X such that only the identity of G fixes
each part of the partition. The symmetric and alternating groups of degre
e n have distinguishing number n and n-1 respectively. On the other hand\,
most primitive groups one meets in the wild have distinguishing number tw
o. In fact\, apart from the symmetric and alternating groups\, the disting
uishing number of a primitive group is bounded by an absolute constant. At
the recent CMSC retreat\, Alice Devillers\, Scott Harper and myself looke
d at a larger class of finite permutation groups\, the quasiprimitive and
semiprimitive groups. I'll report on what we have found happens in these c
ases.\n\nPast and future seminars may be found at\nhttp://www.maths.uwa.ed
u.au/~glasby/GroupsAndCombinatoricsSeminar/S18.html\n\nAll welcome.
DTSTAMP:20180611T051444Z
LAST-MODIFIED:20180612T023823Z
ORGANIZER;CN=Stephen Glasby:MAILTO:glasbys@gmail.com
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar: Luke Morgan\, 4pm Friday 15 June
in Robert Street LT
URL:http://events.uwa.edu.au/event/20180611T051443Z-3080-8534@events.uwa.e
du.au/whatson/CMSC
END:VEVENT
BEGIN:VEVENT
UID:P-20180618T023546Z-3080-10591@events.uwa.edu.au
DTSTART;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180622T160000
DTEND;TZID=/softwarestudio.org/Olson_20010626_2/Australia/Perth:20180622T170000
CLASS:PUBLIC
CREATED:20180618T023547Z
DESCRIPTION:Speaker: Gabriel Verret (Univ. of Auckland)\n\nTitle: Compatib
le local actions in arc-transitive digraphs\n\nTime and place: 4pm Friday
22 Jun 2018\, Blakers LT\n\nAbstract: Given a G-arc-transitive graph\, the
local action is the permutation group induced by a vertex-stabiliser Gv o
n the neighbourhood of v. It plays an extremely important role in the stud
y of these objects. The situation for digraphs is a little more complicate
d. One can consider both the in- and out-local-action\, that is\, the perm
utation group induced by a vertex-stabiliser on the corresponding in- and
out-neighbourhood\, respectively. Perhaps surprisingly\, these two permuta
tion groups need not be isomorphic\, they may not even have the same order
. We say that two permutation groups are compatible if they arise in this
way\, that is\, as the in- and out-local action of some finite G-arc-trans
itive digraph. We will discuss the problem of characterising compatible pe
rmutation groups. It turns out that the question can be reformulated in a
purely group theoretic manner\, in a very nice way.\n\nPast and future sem
inars may be found at\nhttp://www.maths.uwa.edu.au/~glasby/GroupsAndCombin
atoricsSeminar/S18.html\n\nThere will be cake in the Mathematics and Stat
istics tea room at 15:40. The seminar starts at 16:00\, and after 17:05 w
e go to the UniClub for a drink. \n\nAll welcome.\n
DTSTAMP:20180618T023547Z
LAST-MODIFIED:20180618T053613Z
ORGANIZER;CN=Stephen Glasby:MAILTO:glasbys@gmail.com
SEQUENCE:2
SUMMARY:Groups and Combinatorics Seminar: Gabriel Verret\, 4pm Friday 22 J
une in Blakers LT
URL:http://events.uwa.edu.au/event/20180618T023546Z-3080-10591@events.uwa.
edu.au/whatson/CMSC
END:VEVENT
END:VCALENDAR