BEGIN:VCALENDAR
VERSION:2.0
PRODID:PHP
METHOD:REQUEST
TZID:Australia/Sydney
BEGIN:VTIMEZONE
TZID:Australia/Sydney
X-LIC-LOCATION:Australia/Sydney
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130422T120000
DTEND;TZID=Australia/Sydney:20130422T130000
SUMMARY:School Meeting
DESCRIPTION:School Meeting\nV104, Mathematics Building\n\n
UID:361
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130419T102241
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130422T153000
DTEND;TZID=Australia/Sydney:20130422T163000
SUMMARY:CARMA OANT Seminar
DESCRIPTION:CARMA OANT Seminar\nV205, Mathematics Building\n\n"Best approximation in reflexive Banach space (Part IV)"\nLaureate Prof Jon Borwein\n\nAbstract:\nI will survey what is known and some of the open questions.
UID:358
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130415T160154
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130423T120000
DTEND;TZID=Australia/Sydney:20130423T130000
SUMMARY:Discipline Meeting
DESCRIPTION:Discipline Meeting\nV111, Mathematics Building\n\n
UID:362
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130419T102336
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130430T120000
DTEND;TZID=Australia/Sydney:20130430T130000
SUMMARY:CSSE and CARMA Seminar
DESCRIPTION:CSSE and CARMA Seminar\nEF122, Engineering Building F\n\n"Towards a more computational mathematics: rational trigonometry and new foundations for geometry"\nA/Prof Norman Wildberger\n\nAbstract:\nModern mathematics suffers from subtle but serious logical problems connected with the widespread use of infinite sets and the non-computational aspects of real numbers. The result is an ever-widening gap between the theories of pure mathematics and the computations available to computer scientists.\n\nIn this talk we discuss a new approach to mathematics that aims to remove many of the logical difficulties by returning our focus to the all important aspect of the rational numbers and polynomial arithmetic. The key is rational trigonometry, which shows how to rethink the fundamentals of trigonometry and metrical geometry in a purely algebraic way, opens the door to more general non-Euclidean geometries, and has numerous concrete applications for computer scientists interested in graphics and robotics.\n
UID:364
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130423T102351
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130502T160000
DTEND;TZID=Australia/Sydney:20130502T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Prolate spheroidal wavefunctions II"\nDr Jeff Hogan\n\nAbstract:\nThe classical prolate spheroidal wavefunctions (prolates) arise when solving the Helmholtz equation by separation of variables in prolate spheroidal coordinates. They interpolate between Legendre polynomials and Hermite functions. In a beautiful series of papers published in the Bell Labs Technical Journal in the 1960's, they were rediscovered by Landau, Slepian and Pollak in connection with the spectral concentration problem. After years spent out of the limelight while wavelets drew the focus of mathematicians, physicists and electrical engineers, the popularity of the prolates has recently surged through their appearance in certain communication technologies. In this talk we outline some developments in the sampling theory of bandlimited signals that employ the prolates, and the construction of bandpass prolate functions.\nThis is joint work with Joe Lakey (New Mexico State University)
UID:366
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130429T104908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130509T150000
DTEND;TZID=Australia/Sydney:20130509T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV101, Mathematics Building\n\nRe-scheduled from last week.\n\n"Probabilistic Method applied to the Hadamard Maximal Determinant Problem"\nProf Richard Brent\n\nAbstract:\nThis will be a short course of lectures. See http://maths-people.anu.edu.au/~brent/probabilistic.html.
UID:367
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130501T090515
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130513T153000
DTEND;TZID=Australia/Sydney:20130513T163000
SUMMARY:CARMA OANT Seminar
DESCRIPTION:CARMA OANT Seminar\nV205, Mathematics Building\n\n"Conditions for zero duality gap in convex programming"\nAssoc Prof Regina Burachik\n\nAbstract:\nWe introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex optimization. We prove that our condition is weaker than all existing constraint qualifications, including the closed epigraph condition. Our dual condition was inspired by, and is weaker than, the so-called Bertsekas’ condition for monotropic programming problems. We give several corollaries of our result and special cases as applications. We pay special attention to the polyhedral and sublinear cases, and their implications in convex optimization.\nThis research is a joint work with Jonathan M. Borwein and Liangjin Yao.\n
UID:346
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130308T174841
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130516T150000
DTEND;TZID=Australia/Sydney:20130516T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV101, Mathematics Building\n\n"Some Vulnerability Measures and Total Accessibility  "\nElgin Kilic\n\nAbstract:\nVulnerability is the resistance of a network after any\ndisruptions in its links or nodes. Since any network can be modelled by\na graph, many vulnerability measures were defined to observe the\nresistance of networks. For this purpose vulnerability measures such as\nconnectivity,integrity, toughness etc., have been studied widely over\nall vertices of a graph. In recent many researches began to study on\nvulnerability measures on graphs over vertices or edges which have a\nspecial property rather than over all vertices of the graph.\n\nIndependent domination, connected domination and total domination\nmeasures are examples of such these measures. Total Accessibility number\nof a graph is defined as a new measure by choosing the accessible sets $S \subset V$\nwhich have a special property accesibility. Total Accessibility\nnumber of a graph G is based on the accessibility number of a graph. The\nsubsets S are accessible sets of the graph. Accessibility number of any\nconnected graph G is a concept based on neighborhood relation between\nany two vertices by using another vertex connected to both these two\nvertices.
UID:370
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130515T095641
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130516T160000
DTEND;TZID=Australia/Sydney:20130516T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"C-graph automatic groups"\nDr Murray Elder\n\nAbstract:\nGraph automatic groups are an extension of the notion of an automatic group, introduced by Kharlampovich, Khoussainov and Miasnikov in 2011, with the intention to capture a wider class of groups while preserving computational properties such as having quadratic time word problem. We extend the notion further by replacing regular with more general language classes. We prove that nonsolvable Baumslag-Solitar groups are (context free)-graph automatic, (context sensitive)-graph automatic implies a context-sensitive word problem and conversely groups with context sensitive word problem are (context sensitive)-automatic. Finally an obstruction to (context sensitive)-graph automatic implying polynomial time word problem is given.\n\nThis is joint work with Jennifer Taback, Bowdoin College.\n
UID:371
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130515T100321
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130517T160000
DTEND;TZID=Australia/Sydney:20130517T170000
SUMMARY:AMSI Access Grid Seminar
DESCRIPTION:AMSI Access Grid Seminar\nV206, Mathematics Building\n\n"Analysing Random Events on a Network"\nProf Adrian Baddeley\n\nAbstract:\nSpatial patterns of events that occur on a network of lines, such as traffic accidents recorded on a street network, present many challenges to a statistician. How do we know whether a particular stretch of road is a "black spot", with a higher-than-average risk of accidents? How do we know which aspects of road design affect accident risk? These important questions cannot be answered satisfactorily using current techniques for spatial analysis. The core problem is that we need to take account of the geometry of the road network. Standard methods for spatial analysis assume that "space" is homogeneous; they are inappropriate for point patterns on a linear network, and give fallacious results. To make progress, we must abandon some of the most cherished assumptions of spatial statistics, with far-reaching implications for statistical methodology.\n\nThe talk will describe the first few steps towards a new methodology for analysing point patterns on a linear network. Ingredients include stochastic processes, discrete graph theory and classical partial differential equations as well as statistical methodology. Examples come from ecology, criminology and neuroscience.\n
UID:363
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130422T143118
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130520T153000
DTEND;TZID=Australia/Sydney:20130520T163000
SUMMARY:CARMA OANT Seminar
DESCRIPTION:CARMA OANT Seminar\nV205, Mathematics Building\n\n"Cyclic Douglas-Rachford Iterations"\nMr Matt Tam\n\nAbstract:\nIn this talk we introduce a Douglas-Rachford inspired projection algorithm, the cyclic Douglas-Rachford iteration scheme. We show, unlike the classical Douglas-Rachford scheme, that the method can be applied directly to convex feasibility problems in Hilbert space without recourse to a product space formulation. Initial results, from numerical experiments comparing our methods to the classical Douglas-Rachford scheme, are promising.\nThis is joint work with Prof. Jonathan Borwein.
UID:349
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130311T143517
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130521T120000
DTEND;TZID=Australia/Sydney:20130521T130000
SUMMARY:CSSE and CARMA Seminar
DESCRIPTION:CSSE and CARMA Seminar\nEF122, Engineering Building F\n\n"The Proof of the Four Colour Theorem"\nMichael Reynolds\n\nAbstract:\nWe will discuss the substantial mathematical, computational,\nhistorical and philosophical aspects of this celebrated and controversial\ntheorem. Much of this talk should be accessible to undergraduates, but we\nwill also discuss some of the crucial details of the actual revision by\nRobertson, Sanders, Seymour and Thomas of the original Appel-Haken computer\nproof. We will additionally cover recent new computer proofs by Gonthier,\nand by Steinberger, and also the generalisations of the theorem by Hajos\nand Hadwiger which are currently still open. New software developed by the\nspeaker will be used to visually illustrate many of the subtle points\ninvolved, and we will examine the air of controversy that still surrounds\nexisting computer proofs. Finally, the prospect of a human proof will be\ncanvased.\n\nABOUT THE SPEAKER: Mr Michael Reynolds has a Masters degree in Maths and\nan extensive experience in Software Industry. He is currently doing his PhD\nin Graph Theory at the University of Newcastle.\n
UID:372
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130516T122401
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130521T120000
DTEND;TZID=Australia/Sydney:20130521T130000
SUMMARY:Teaching Series Seminar
DESCRIPTION:Teaching Series Seminar\nV129, Mathematics Building\n\n"A joint presentation from members of the Schools of Education and MAPS"\nVarious Members\n\nAbstract:\nIn response to a recent report from Australia's Chief Scientist\n(Prof Ian Chubb), the Australian government recently sought applications\nfrom consortia of universities (and other interested parties) interested in\ndeveloping pre-service programs that will improve the quality of\nmathematics and science school teachers.  In particular, the programs\nshould:\n\nbe multi-institutional and cross-faculty and\nproduce teachers who view mathematics and science as contemporary,\ndynamic, forward-looking and collaborative human endeavours.\n\n\n\nAt UoN, a group of us from Education and MAPS produced the outline of a\nvision for our own BTeach/BMath program which builds on local strengths.\nIn the context of very tight timelines, this became a part of an\napplication together with five other universities.  In this seminar we will outline\nthe vision that we produced, and invite further contributions and\nparticipation, with a view to improving the BMath/BTeach program regardless\nof the outcome of the application of which we are a part.
UID:374
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130520T094855
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130527T153000
DTEND;TZID=Australia/Sydney:20130527T163000
SUMMARY:CARMA OANT Seminar
DESCRIPTION:CARMA OANT Seminar\nV205, Mathematics Building\n\n"Computation of an Improved Lower Bound to Giuga’s Primality Conjecture"\nMr Matt Skerritt\n\nAbstract:\nOur most recent computations tell us that any counterexample to Giuga’s 1950 primality conjecture must have at least 19,907 digits. Equivalently, any number which is both a Giuga and a Carmichael number must have at least 19,907 digits. This bound has not been achieved through exhaustive testing of all numbers with up to 19,907 digits, but rather through exploitation of the properties of Giuga and Carmichael numbers. We introduce the conjecture and an algorithm for finding lower bounds to a counterexample, then present our recent results and discuss challenges to further computation.
UID:369
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130514T173646
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130528T143000
DTEND;TZID=Australia/Sydney:20130528T153000
SUMMARY:AMSI Access Grid Seminar
DESCRIPTION:AMSI Access Grid Seminar\nV206, Mathematics Building\n\n"Incremental Network Design"\nProf Martin Savelsbergh\n\nAbstract:\nNetwork infrastructures are a common phenomenon. Network upgrades and expansions typically occur over time due to budget constraints. We introduce a class of incremental network design problems that allow investigation of many of the key issues related to the choice and timing of infrastructure expansions and their impact on the costs of the activities performed on that infrastructure. We examine three variants: incremental network design with shortest paths, incremental network design with maximum flows, and incremental design with minimum spanning trees. We investigate their computational complexity, we analyse the performance of natural heuristics, we derive approximation algorithms and we study integer program formulations.
UID:365
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130424T144644
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130624T153000
DTEND;TZID=Australia/Sydney:20130624T163000
SUMMARY:CARMA OANT Seminar
DESCRIPTION:CARMA OANT Seminar\nV205, Mathematics Building\n\n"Voronoi cells of arbitrary sets"\nProf Miguel Ángel Goberna Torrent\n\nAbstract:\nGiven a set T of the Euclidean space, whose elements are called sites, and a particular site s, the Voronoi cell of s is the set formed by all points closer to s than to any other site. The Voronoi diagram of T is the family of Voronoi cells of all the elements of T. In this talk we show some applications of the Voronoi diagrams of finite and infinite sets and analyze direct and inverse problems concerning the cells. We also discuss the stability of the cells under different types of perturbations and the effect of assigning weights to the sites.
UID:368
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130509T123813
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20130708T090000
DTEND;TZID=Australia/Sydney:20130712T170000
SUMMARY:Mathematics of Planet Earth
DESCRIPTION:Mathematics of Planet Earth\n, \n( Campus, RMIT University)\n\nMPE Australia 2013\n\nThis conference is the central scientific event of MPE Australia 2013, bringing together the scientific community to address the mathematical contribution to the challenges of the planet and creating a platform to launch new scientific collaborations.
UID:340
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20130221T121601
END:VEVENT
END:VCALENDAR