May 2014

Friday 02 
15:00  SEMINAR  Groups and Combinatorics Seminar, Some recent results on elusive groups

More Information

Michael Giudici (UWA)
will speak on
Some recent results on elusive groups
at 3pm Friday May the 2nd in Weatherburn Lecture Theatre.
Abstract:
Every transitive permutation group has a derangement of prime power order but not necessarily a derangement of prime order. A transitive permutation group is called elusive if it has no derangements of prime order. I will talk about some recent results on this topic including elusive groups of automorphisms of graphs of small valency and a new construction of elusive groups.

Friday 09 
15:00  SEMINAR  Groups and Combinatorics Seminar, Locallytransitive graphs and their vertex stabilisers

More Information

Luke Morgan (UWA)
will speak on
Locallytransitive graphs and their vertex stabilisers
at 3pm Friday May the 9th in Weatherburn Lecture Theatre.
Abstract:
Let D be a graph with a group of automorphisms G and suppose that D is Glocallyarctransitive (for each vertex x of D the vertex stabiliser G(x) acts transitively on the neighbourhood of x). Fixing the valency of D one can ask if there is a bound on the order of G(x)? For valency three there are fundamental results due to Tutte and Goldschmidt. We'll instead fix the `local actions’, that is, the possible permutation groups induced on neighbourhoods in D (there can be at most two of these) and ask again: is there a bound on the order of G(x)? I will revisit some of the interesting results on this question. Then I will talk about some recent results like: when there can be a bound; when there is no bound; given a bound (and a little more) an instance when G(x) can be completely determined.
Spread throughout this is joint work with Giudici, GiudiciIvanovPraeger and SpigaVerret.

Friday 16 
15:00  SEMINAR  Groups and Combinatorics Seminar, Classic problems of packing in 2d, 3d and on a cylinder

More Information

Denis Weaire
Gledden Visiting Fellow, Institute for Advanced Studies, UWA
and
School of Physics, Trinity College, Dublin, Ireland
will speak on
Classic problems of packing in 2d, 3d and on a cylinder
at 3pm Friday May the 16th in Weatherburn Lecture Theatre.
Abstract:
Some classic problems of optimal packing are reviewed: the Kepler Problem, the Kelvin Problem, and cylindrical packings of spheres and disks. The latter are tentatively associated with the celebrated phenomenon of spiral Phyllotaxis, much in evidence in the splendid gardens of UWA. If the speaker omits or forgets anything, it is to be found in the book Pursuit of Perfect Packing, T. Aste and D. Weaire, 2nd Edition.

Tuesday 20 
iVEC and CSIRO invite you to attend training on MOOSE – Multiphysics ObjectOriented Simulation Environment. The MOOSE platform is a general problem solver that can accommodate many mathematical models. It has recently been released as opensource software, making it even easier for academic researchers to adopt. Some of the capabilities of MOOSE include: Fullycoupled, fullyimplicit multiphysics solver Dimension independent physics Automatically parallel (largest runs >100,000 CPU cores!) Modular development simplifies code reuse Builtin mesh adaptivity Continuous and Discontinuous Galerkin (DG) (at the same time!) Intuitive parallel multi scale solves Dimension agnostic, parallel geometric search (for contact related applications) Flexible, plugable graphical user interface ~30 plugable interfaces allow specialisation of every part of the solve More information about MOOSE can be found at the MOOSE website: https://mooseframework.org Please refer to the URL for the Program Overview and more information. Cody Permann’s visit is sponsored by CSIRO to support researchers in WA. If you would like to arrange a meeting with Cody, please contact Thomas Poulet < [email protected]>, other enquiries should be directed to Rebecca HartmanBaker < [email protected]>. Although the training is free, you must register your attendance (through the URL) as places are limited. The intensive program builds a solid foundation for MOOSE use, so attendance on all three days is advised.

Friday 23 
15:00  SEMINAR  Groups and Combinatorics Seminar, Chromatic roots of graphs and matroids

More Information

Gordon Royle (UWA)
will speak on
Chromatic roots of graphs and matroids
at 3pm Friday May the 23rd in Weatherburn Lecture Theatre.
Abstract:
The location of the real and/or complex roots of the chromatic polynomial of a graph has been studied for many years, both by combinatorial mathematicians and statistical physicists, yet despite this many fundamental questions remain unsolved. And even though the chromatic polynomial is most generally a matroidal concept, very little indeed is known about the location of chromatic roots of matroids that are not graphic or cographic. In this talk, I will present a necessarilypersonal survey of the major results and my favourite open problems in this area.

Friday 30 
15:00  SEMINAR  Groups and Combinatorics Seminar, Taking products of permutation groups

More Information

Simon Smith (UWA)
will speak on
Taking products of permutation groups
at 3pm Friday May the 30th in Weatherburn Lecture Theatre.
Abstract:
At the AustMS conference, I introduced a new product for permutation groups. At the time, I was in a rush to announce the result because it could be used to solve an open question of P. E. Caprace and N. Monod. Since that talk, much has changed: I have an entirely new construction method that expands the scope of the construction, and I have extended many of the results describing its properties.
In this talk I'll introduce the product again, but this time in more detail. I'll sketch a proof of one of its most striking properties, and I'll talk about three areas of research in which the product has proved to be important (one of which is my DECRA project!).
The content of the talk will be largely combinatorial, and there will be no topology (although I may use the word "closed" accidentally, for which I hope I will be forgiven).
The 2014 Blakers Mathematics Competition is now open. Eligible candidates are all undergraduates in first, second and third
years at a WA university. Entries must be received by Friday, 26 September, 2014. They may be mailed
or given to Dr Greg Gamble, School of Mathematics and Statistics, The
University of Western Australia, Crawley, 6009. It is recommended that a
PDFscanned copy of your entry is also emailed to [email protected]
Please mark your entry Blakers Mathematics Competition 2014, and include
your name, address, email address, university, and number of years you have
been attending any tertiary institution. More details about how to enter can be found at
https://www.maths.uwa.edu.au/students/competitions


June 2014

Monday 02 
In the week beginning 2 June 2014, iVEC will offer the following free short courses on supercomputing topics: Introduction to iVEC: 2:00 – 3:00pm Mon 2nd June Introduction to Linux: 3:30 – 4:30pm Mon 2nd June Introduction to Supercomputing: 10:00am – 4:00pm Tues 3rd June Developing with MPI and OpenMP: 10:00am – 4:00pm Wed 4th June. Further details of the courses and the registration form can be found on the iVEC website.
Courses are delivered in a face to face classroom style. Attendees are encouraged to bring and work on their own laptops. Staff from the Supercomputing Team will be facilitating so you can meet and chat with them. Any queries, please contact Dr Rebecca HartmanBaker – [email protected]This is a free event however, you must register as places are limited.

Thursday 05 
15:00  SEMINAR  Groups and Combinatorics Seminar, Computing KazhdanLusztig Polynomials and some Applications

More Information

Frank Lübeck (RWTH Aachen)
will speak on
Computing KazhdanLusztig Polynomials and some Applications
at 3pm Thursday June the 5th in Maths Lecture Room 2.
Abstract:
My interest in KazhdanLusztig polynomials comes from a certain character formula for reductive algebraic groups, which was first conjectured by Lusztig.
More generally, parabolic KazhdanLusztig polynomials can be defined for arbitrary Coxeter groups. These polynomials are notoriously difficult to compute. I will report on an implementation of an algorithm to compute them, which goes much further than previous programs.
It turned out that some of the coefficients of KazhdanLusztig polynomials that I was able to compute have interesting (and for me unexpected) interpretations in the context of conjectures by Guralnick (on a bound of the dimension of first cohomology groups for finite groups) and Wall (on the number of maximal subgroups of any finite group). I will also explain these conjectures and sketch the connection between these topics.

Tuesday 24 
The aim of this course is to introduce you to basic statistics. It will cover descriptive statistics (means and standard deviations); data exploration; basic categorical data analysis; simple linear regression and basic analysis of variance (ANOVA). The statistical package SPSS will be used to illustrate the ideas demonstrated. The course will be held in a computer laboratory allowing participants to immediately apply the material covered through a series of practical examples.


July 2014

Tuesday 01 
R is a free and extremely powerful language and software environment for statistical computing, data analysis, and graphics. The course is designed for those who have no experience with R, but have a basic understanding of statistics. The course will include: Introduction to R: How to install R on your computer; basic R commands, how to use and understand the R help pages. Data: Reading in data and data manipulation; summarising data; basic statistical analysis and fitting linear models. Graphics and output: Basic plotting commands and how to customise your plots; how to export your plots and output in a userfriendly format. Functions: Writing simple functions and flow control structures.

Tuesday 08 
9:00  COURSE  ANOVA, Linear Regression and Logistic Regression : A Short Course using SPSS

Website 
More Information

The course is designed for people with knowledge of basic statistics who want to learn more about regression and analysis of variance (ANOVA).
This course covers techniques that can be used to analyse data with continuous and categorical variables. The course will begin with simple linear regression and then proceed with approaches that can be used with more than two variables such as multiple regression. ANOVA with interactions and blocking will also be covered. The course will end with techniques that address the analysis of binary or ordinal variables.

Monday 14 
The course is designed as an applied course in Structural Equation Modelling (SEM) using the Mplus software package. SEM is used widely by researchers to test complex relationships among observed (measured) and latent (unobserved) variables and subsumes other analytical techniques such as regression, path analysis, factor analysis, and canonical correlation. Mplus is rapidly becoming the program of choice for the analysis of SEMs. Mplus offers a general modelling framework that allows both the modelling of crosssectional and longitudinal data using observed variables that are a combination of continuous and categorical variables. In addition, Mplus analyses multilevel modelling structures.
The first three days of the course will be an introduction to SEM and the Mplus program. The focus of the last two days of the course is on the analysis of more advanced SEM models.
If you are familiar with the Mplus program and have an understanding of material typically covered in an introduction to SEM course, you may choose to attend only the last two days of the course.
If you have completed an introductory course in SEM using another program (e.g., Amos, Lisrel, EQS) but have not previously used the Mplus program, you may choose to attend the first day and then the last two days of the course.

Wednesday 23 
This course aims to provide you with an introduction to the facilities available in MS Excel from a statistical point of view. As well as an introduction to Excel, spreadsheet functions and graphics, it concentrates on performing basic statistical methods, producing charts and tables, and discusses the limitations of Excel when it comes to more complex statistical analysis.


August 2014

Friday 01 
15:00  SEMINAR  Groups and Combinatorics Seminar: Quasiisometry and commensurability for rightangled Coxeter groups

More Information

Anne Thomas (University of Glasgow)
will speak on
Quasiisometry and commensurability for rightangled Coxeter groups
at 3pm Friday 1 August in Weatherburn Lecture Theatre
Abstract:
Let Gamma be a finite simple graph with vertex set S. The associated rightangled Coxeter group W_Gamma is the group with generating set S, and relations s^2 = 1 for all s in S and st = ts if and only if s and t are adjacent vertices. We investigate the classification of such W_Gamma up to quasiisometry, which is a "coarse" equivalence relation on finitely generated groups formulated by Gromov, and also up to commensurability, where two groups G and H are commensurable if they have isomorphic finite index subgroups. Our methods are geometric and topological. This is joint work with Pallavi Dani (Louisiana State University) and Emily Stark (Tufts University).

Friday 08 
15:00  SEMINAR  Groups and Combinatorics Seminar: Codes from quadrics in symplectic space

More Information

Mark Ioppolo (UWA)
will speak on
Codes from quadrics in symplectic space
at 3pm 8 August in Weatherburn LT
Abstract: Whether combinatorial or group theoretic, symmetry plays an important role in the construction and analysis of error correcting codes in graphs. A code in a graph is called neighbourtransitive if it admits a group of automorphisms which stabilises the codewords setwise, while acting transitively on the codewords and codeneighbours.
I will discuss the work of Liebler and Praeger towards a classification of error correcting codes in Johnson graphs and present recent progress relating to families of codes associated with embeddings of hyperbolic and elliptic quadrics in binary symplectic space.

Sunday 10 
10:00  OPEN DAY  2014 Open Day : Join us for our Open Day and experience all that UWA has to offer

Website 
More Information

Come and find out about UWA’s undergraduate and postgraduate courses, scholarship opportunities, outstanding career options and explore our community programs and facilities.
This year there will be campus tram tours, handson activities, live music and entertainment, as well as plenty of fun activities for the whole family to enjoy.
Join us for Open Day 2014 from 10.00am to 4.00pm on Sunday 10 August.

Friday 15 
15:00  SEMINAR  Groups and Combinatorics Seminar: Locally triangular graphs and rectagraphs with symmetry

More Information

Groups and Combinatorics Seminar
Joanna Fawcett (UWA)
will speak on
Locally triangular graphs and rectagraphs with symmetry
at 3pm on Friday 15 of August in Weatherburn LT
Abstract: Locally triangular graphs are known to be halved graphs of bipartite
rectagraphs, which are connected trianglefree graphs in which every
2arc lies in a unique quadrangle. A graph is locally rank 3 if it has a
group of automorphisms G such that for each vertex u, the permutation
group induced by the vertex stabiliser of u in G on the neighbourhood of
u is transitive of rank 3. One natural place to seek locally rank 3
graphs is among locally triangular graphs. In this talk, we will discuss
our classification of the connected locally triangular graphs that are
also locally rank 3, which we obtain by classifying the locally
4homogeneous rectagraphs (with some additional structure). This is
joint work with J. Bamberg, A. Devillers and C. Praeger.

Friday 22 
12:00  SEMINAR  Economics Discipline Seminar : Instrument endogeneity, weak identification, and inference in IV regressions

Website 
More Information

15:00  SEMINAR  Groups and Combinatorics Seminar, Designs and Elusive Codes in Hamming Graphs

More Information

Daniel Hawtin (UWA)
will speak on
Designs and Elusive Codes in Hamming Graphs
at 3pm Friday August the 22nd in Weatherburn Lecture Theatre.
Abstract:
We consider a code to be a subset of the vertices of a Hamming graph. The set of sneighbours of a code are those vertices which are distance s from some codeword, but not distance r from any codeword, for 0 <= r < s. The automorphism group of a code necessarily fixes the set of sneighbours of the code. An selusive code is a code such that the automorphism group of the set of sneighbours is strictly larger than the automorphism group of the code itself. We provide examples for s=1,2,3, including a family of ReedMuller codes and the Preparata codes. We also discuss some restrictions on the parameters of elusive codes and show that an elusive code gives rise to a qary tdesign. This fact is used to provide a new construction for the NordstromRobinson code.


Alternative formats:
Default 
XML
