# Seminar Archive - 2020

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

*Daniel Horsley - Monash University*

Let S be a collection of derangements (fixed point-free permutations) of a possibly infinite set X. The derangement action digraph DA(X,S) is the digraph on vertex set X that has an arc from x to y...

*Martin Helmer - Australian National University*

In this talk I will consider two invariants associated to pairs of strata X , Y in an analytic stratification of some ambient complex projective variety W. The main result states that if the closure...

*Katherine Staden - University of Oxford*

In a graph decomposition problem, the goal is to partition the edge set of a host graph into a given set of pieces. I will focus on the setting where the host graph and the pieces have a comparable...

*Annika Heckel - LMU Munich*

There are many impressive results asserting that the chromatic number of a random graph is sharply concentrated. In 1987, Shamir and Spencer showed that for any function $p=p(n)$, the chromatic...

*Victoria Gu - UNSW Sydney*

An elliptic curve over a field k is a smooth projective curve of genus 1 with a distinguished point O. With Riemann-Roch theorem and assuming that char(K) $\neq$ 2,3 , every elliptic curve can be...

*Zachary Edelstein - UNSW Sydney*

A social network can be represented as a collection of nodes and edges. The nodes represent the people in the network and the edges (or links) between nodes signify a relationship, such as...

*Rumi Salazar - UNSW Sydney*

In the 1980s, a relationship was found between the two fields of symplectic geometry and geometric invariant theory (GIT) via the Kempf-Ness theorem. Symplectic geometry generalises the notion of...

*Tamás Makai - UNSW Sydney*

Majority dynamics is a deterministic process on a graph which evolves in the following manner. Initially every vertex is coloured either red or blue. In each step of the process every vertex adopts...

*Tuan Tran - Institute for Basic Science*

Let $Q_n$ be a random $n$ by $n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the probability that $Q_n$ is singular is...

*Michael Libman - UNSW Sydney*

At the intersection of graph theory, extremal set theory and optimisation theory lies a collection of mathematical results often known as ‘min-max theorems’ and include celebrated combinatorial...