# 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.

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...

Tamás Mészáros - Freie Universität Berlin
Given a set $S$ of $v\geq 2$ symbols, and integers $k \geq t \geq 2$ and $N \geq 1$,  an $N \times k$ array $A \in S^{N \times k}$ is an $(N; t, k, v)$-covering array if all sequences in $S^t$ appear...

Mikhail Isaev - UNSW Sydney
Let $T$ be a uniform random tree on $n$ vertices. We are interested in the distribution of $F(T)$, where the function $F$ could depend significantly on the tree structure. It is natural to use Prüfer...

Shenwei Huang - UNSW, School of Computer Science and Engineering
An even hole is an induced cycle of even length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this talk, we consider (...

Changhao Chen - UNSW Sydney
Recently there has been a growing interest in studying finite field versions of some classical problems arising from Euclidean spaces. In this talk we study the finite field version of a basic...

Fiona Skerman - University of Bristol
An important problem in network analysis is to identify highly connected components or 'communities'. Most popular clustering algorithms work by approximately optimising modularity. Given a graph G,...

Yasmeen Shameen - Indian institute of Science Education and Research, Pune, INDIA
Covering arrays are a relaxation of orthogonal arrays to covering hypothesis that have been successfully applied in the design of test suites for testing systems such as software, circuits and...

Peter Ayre - UNSW
A hypergraph is $k$-uniform if every hyperedge contains $k$ vertices. A colouring of a hypergraph is an assignment of colours to the vertices such that no hyperedge is monochromatic. We consider the...