Past Events

The Australasian Combinatorics Conference (ACC) is the annual conference of the Combinatorial Mathematics Society of Australasia (CMSA). It covers all areas of combinatorics in mathematics and computer science. It began in 1972, and was previously...

In this talk, we will discuss several areas of recent work centered around the themes of fairness and foundations in machine learning as well as highlight the challenges in this area. We will discuss recent results involving linear algebraic tools...

Measure zero sets containing intricate structure are foundational in geometric measure theory. These include Besicovitch sets in the plane (also known as Kakeya sets), which are measure zero sets containing a line in every direction. Closely related...

Are there really primitive tribes whose system of counting goes: “One, Two, Many,...” indicating that from three on it’s a blur? It’s surprising how little progress we’ve made in addressing some basic problems in 3D or beyond, or when solving...

The Steenrod algebra acts on ordinary cohomology with coefficients in a finite field, thereby refining the invariant that is cohomology. In this talk, I discuss its formal properties and applications.

Abstract: Recent advances in experimental methodologies and large-scale community efforts have led to an explosion of single-cell genomics and imaging data, creating a need for new analytical frameworks capable of extracting meaningful structure and...

Given a complex Lie group G of adjoint type, the wonderful compactification Y(G) (originally described by work of DeConcini-Procesi) is a compactification of G by a divisor with simple normal crossings. These groups are specified by their Dynkin...

In this talk we will address the relatively new objects quaternary Legendre pairs. These objects (and their binary counterparts) were introduced in order to construct Hadamard matrices and have garnered renewed interest recently. Over the course of...

Falconer-type problems seek Hausdorff-dimension thresholds guaranteeing that thin subsets of R d contain rich geometric patterns. For a compact set E ⊂ R d , the classical object is the distance set ∆(E) = { |x − y| : x, y ∈ E }, and its pinned...

Neurons are often viewed as the fundamental units of computation, yet they are also living cells that must sustain this computation within the physical and metabolic limits of biology. In this talk, I present a quantitative framework for...