# Coming Seminars

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

Bill McLean

This talk is an overview of the discontinous Galerkin (DG) method as a time-stepping procedure for classical and fractional diffusion problems. After motivating the definition of the procedure, I outline its implementation and then illustrate key...

Prof N J Wildberger

The most important 20th century development in the theory of curves and surfaces was initiated by two French car engineers around 1960. The quadratic and cubic curves they introduced, with further extensions called B-splines and NURBS, have gone on...

Anne Thomas

The notion of divergence of geodesics was introduced by Gromov in the 1980s as a way of quantifying how fast a pair of geodesic rays in a space move away from each other. Gersten then used this idea to formulate a quasi-isometry invariant for...

Ágnes Cseh

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$ is popular if $M$ does not lose a head-to-head...

Dr Daniel Mansfield

We discuss Si.427 from the Istanbul Archeological Museum, which was recently discovered to be one of the most complete examples of applied geometry from the ancient world, and demonstrates that trigonometry did not begin with the Greeks studying the...

Liana Yepremyan

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 does not contain a copy of $F$. For graphs, the...

16 May 2019 - 11:05am - Addressing redundancy in column generation using Benders' decomposition cuts

Dr Stephen J Maher

When solving the linear programming (LP) relaxation of a mixed-integer program (MIP) with column generation, columns might be generated that are not needed to express any integer optimal solution of the MIP. Such columns are called strongly...

Bui Thi Hoa

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 with minimum degree $\delta$ is $\min\{\delta, 2d...