Full Seminar Archive

Our regular seminar program covers a broad range of topics from applied mathematics, pure mathematics and statistics. All staff and students are welcome. This page has a complete list of past seminars and a list restricted by year can be accessed via the left-hand menu.

Bui Thi Hoa - Federation University Australia
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The first part of the talk we will establish that for any $d\ge 4$, the graph of a cubical $d$-polytope...

Liana Yepremyan - Oxford University
A central problem of extremal combinatorics is to determine the Turán number of a given graph or a hypergraph $F$, i.e. the maximum number of edges in an $r$-uniform hypergraph on $n$ vertices that...

Faezeh Alizadeh - Shahid Rajaee Teacher Training University, Iran; and University of Western Australia
 Let $F$ be a field and $F^{r \times s}$ denote the space of $r \times s$ matrices over $F$. Let $K$ be an extension of $F$. Given matrices $A$ in $K^{r \times r}$ and $B$ in $K^{s \times s}$ we call...

Ágnes Cseh - Hungarian Academy of Sciences
Our input is a complete graph $G=(V,E)$ on $n$ vertices where each vertex has a strict ranking of all other vertices in $G$. Our goal is to construct a matching in $G$ that is popular. A matching $M...

Ziyu Li - UNSW
Given rules for substituting the edges of a graph by subgraphs, it is of interest to determine the properties of the resulting iterative graphs. One of the significant problems in this respect is to...

Rutvik Oza - UNSW
In the game of cops and robbers, the cops try to capture a robber moving on the vertices of the graph. Though the game is well studied on graphs, there are very few results on directed or oriented...

Nina Kamcev - Monash University
A subset S of initially infected vertices of a graph G is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a...

Jane Tan - ANU
 A feature of Eulerian circuits, evidenced for instance by Hierholzer's algorithm, is that in general they have many subcircuits and subcycles. We say that an Eulerian circuit is $k$-locally self-...

Yusra Naqvi - The University of Sydney
Jack polynomials form a basis for the ring of symmetric polynomials, generalising several other classical families of polynomials, including Schur polynomials. There is an ongoing search for direct...

Hsien-Kuei Hwang - Academia Sinica, Taipei
A class of recurrences of Eulerian type is examined from the viewpoint of asymptotic distribution of the coefficients. We characterize various limit laws of the coefficients using the method of...

Pages