## Archived seminars in MathematicsSeminars 1 to 50 | Next 50 seminars |

### Brendan Creutz

*School of Mathematics and Statistics, University of Canterbury*

Date: Tuesday 14 May 2019

### Michael Albert

*University of Otago Computer Science*

Date: Tuesday 7 May 2019

### Geertrui van de Voorde

*School of Mathematics and Statistics University of Canterbury*

Date: Tuesday 16 April 2019

### Sarah Wakes

*Department of Mathematics and Statistics*

Date: Tuesday 9 April 2019

### Tim Candy

*Department of Mathematics and Statistics*

Date: Tuesday 2 April 2019

### Conor Finnegan

*University College Dublin*

Date: Tuesday 26 March 2019

### Andrew Robinson

*University of Melbourne*

Date: Thursday 21 March 2019

### Lech Szymanski

*Department of Computer Science, University of Otago*

Date: Tuesday 19 March 2019

### Robert van Gorder

*Department of Mathematics and Statistics, University of Otago*

Date: Tuesday 12 March 2019

These conditions generalize a variety of results known in the literature, such as the algebraic inequalities commonly used as sufficient criteria for the Turing instability on static domains, and approximate or asymptotic results valid for specific types of growth, or for specific domains.

### Russell Higgs

*School of Mathematics and Statistics, University College Dublin*

Date: Tuesday 5 March 2019

### Alex Gavryushkin

*Department of Computer Science University of Otago*

Date: Tuesday 16 October 2018

### Marnus Stoltz

*Department of Mathematics and Statistics*

Date: Tuesday 9 October 2018

### Nikola Stoilov

*University of Burgundy*

Date: Tuesday 25 September 2018

### Mike Hendy

*Department of Mathematics and Statistics*

Date: Tuesday 18 September 2018

$|a_{ij} |≤1,∀i,j⟹|det(A) |≤n^{(n⁄2)}$,

and found matrices satisfying this bound for many values of $n$.

An $n×n$ real matrix $A=(a_{ij})$ with entries $|a_{ij}|≤1$ satisfying

$| det(A)|=n^{(n∕2)}$

is now referred to as a Hadamard matrix. We will see that for $n≥4$, Hadamard matrices can exist only for $n≡0$ (mod 4). Although there are Hadamard matrices for an infinite number of multiples of 4, the Hadamard conjecture that postulates there exists a Hadamard matrix of order $n$, for each positive integer multiple of 4, has remained unresolved for 125 years.

In this talk I will present some practical applications of Hadamard matrices, including my own discovery of their application in phylogenetics, and reveal a personal encounter with Hadamard's ghost.

### Alex Gavryushkin

*Department of Computer Science*

Date: Tuesday 11 September 2018

### Chris Stevens

*Rhodes University, South Africa*

Date: Tuesday 4 September 2018

We are now in the exciting new era of gravitational wave astronomy, where we can study the universe through the gravitational waves emitted by massive events such as coalescing black holes or neutron stars.

An important part of gravitational wave astronomy is the numerical simulations that compute the emitted gravitational radiation, which are non-trivial since the simulations are on a physical domain of finite extent but gravitational waves are unambiguously defined only at future null infinity (scri+). There are a number of methods for waveform estimation, but only in characteristic extraction is the waveform calculated at scri+.

We present a new algorithm and implementation of characteristic extraction. It has the key feature of being simply extendable to characteristic matching, in which the characteristic evolution provides outer boundary data for the "3+1" simulation. The key advantage of characteristic matching is that it would lead to a significant speed-up in the time required to complete a numerical simulation.

### Melissa Tacy

*Department of Mathematics and Statistics*

Date: Tuesday 21 August 2018

### Dominic Searles

*Department of Mathematics and Statistics*

Date: Tuesday 14 August 2018

### David Bryant

*Department of Mathematics and Statistics*

Date: Thursday 9 August 2018

### Ilija Tolich

*Department of Mathematics and Statistics*

Date: Tuesday 31 July 2018

The Baumslag-Solitar group is an example of an amenable quasi-lattice ordered group. In particular, it is an HNN-extension of the integers. Studying the Baumslag-Solitar group gave us the insight to prove a new means of detecting amenability in quasi-lattice ordered groups and also to construct new examples of amenable quasi-lattice ordered groups.

### Dominic Searles

*Department of Mathematics and Statistics*

Date: Tuesday 29 May 2018

In joint work with Assaf, we consider the application of Kohnert's algorithm to arbitrary box diagrams in the positive quadrant; we call the resulting polynomials Kohnert polynomials. We establish some structural results about Kohnert polynomials, including that their stable limits are quasisymmetric. Certain choices of box diagrams yield bases of the polynomial ring in a natural way; as an application, we use these results to introduce a new basis of polynomials whose stable limit is a new basis of quasisymmetric functions that contains the Schur functions. Some further conjectures regarding Kohnert polynomials will be presented.

### Honours and PGDip students

*Department of Mathematics and Statistics*

Date: Friday 25 May 2018

Qing Ruan : ~~Bootstrap selection in kernel density estimation with edge correction~~

Willie Huang : ~~Autoregressive hidden Markov model - an application to tremor data~~

MATHEMATICS

Tom Blennerhassett : ~~Modelling groundwater flow using Finite Elements in FEniCS~~

Peixiong Kang : ~~Numerical solution of the geodesic equation in cosmological spacetimes with acausal regions~~

Lydia Turley : ~~Modelling character evolution using the Ornstein Uhlenbeck process~~

Ben Wilks : ~~Analytic continuation of the scattering function in water waves~~

Shonaugh Wright : ~~Hilbert spaces and orthogonality~~

Jay Bhana : ~~Visualising black holes using MATLAB~~

### Boris Daszuta

*Department of Mathematics and Statistics*

Date: Tuesday 22 May 2018

In particular, assuming a moment in time symmetry in vacuum reduces the problem of solving the constraints to a restriction of zero scalar curvature associated with the initial data set. A result due to [1] at the analytical level provides a technique for local control on the aforementioned set and may be used to engineer initial data with well-defined asymptotics. In short, one may glue together distinct, known solutions from differing regions in a controlled manner forming new data.

The aim of this talk is to demonstrate how a numerical scheme may be fashioned out of the above and present results pertaining to a numerical gluing construction.

Ref:

[1]: (Corvino, J.) Scalar Curvature Deformation and a Gluing Construction for the Einstein Constraint Equations. ~~Communications in Mathematical Physics~~ 214, 1 (2000), 137-189.

### Markus Antoni

*Department of Mathematics and Statistics*

Date: Tuesday 15 May 2018

### Joshua Ritchie

*Department of Mathematics and Statistics*

Date: Tuesday 8 May 2018

### Lettie Roach

*Victoria University Wellington and NIWA*

Date: Tuesday 1 May 2018

### Valerie Isham, NZMS 2018 Forder Lecturer

*University College London*

Date: Tuesday 24 April 2018

In this talk, I will review some stochastic point process-based models constructed in continuous time and continuous space using spatial-temporal examples from hydrology such as rainfall (where flood control is a particular application) and soil moisture. By working with continuous spaces, consistent properties can be obtained analytically at any spatial and temporal resolutions, as required for fitting and applications. I will start by covering basic model components and properties, and then go on to discuss model construction, fitting and validation, including ways to incorporate nonstationarity and climate change scenarios. I will also describe some thoughts about using similar models for wildfires.

### Valerie Isham, NZMS 2018 Forder Lecturer

*University College London*

Date: Monday 23 April 2018

Epidemic models are developed as a means of gaining understanding about the dynamics of the spread of infection (human and animal pathogens, computer viruses etc.) and of rumours and other information. This understanding can then inform control measures to limit spread, or in some cases enhance it (e.g., viral marketing). In this talk, I will give an introduction to simple generic epidemic models and their properties, the role of stochasticity and the effects of population structure (metapopulations and networks) on transmission dynamics, illustrating some past successes and outlining some future challenges.

### Robert Aldred

*Department of Mathematics and Statistics*

Date: Tuesday 17 April 2018

Several attempts at proving the famous 4-colour theorem involved the existence of Hamiltonian cycles in planar graphs related to triangulations of the plane. We will discuss some of these and outline a proof that that the number of Hamiltonian cycles in a 5-connected planar triangulation on $n$ vertices grows exponentially with $n$.

### Mihály Kovács

*Chalmers University of Technology and Gothenburg University*

Date: Tuesday 10 April 2018

### Sergei Fedotov

*The University of Manchester*

Date: Tuesday 27 March 2018

### Yawen Chen

*Department of Computer Science*

Date: Tuesday 20 March 2018

In this talk, I would like to introduce my recent graph-related research problems on Optical Network-on-Chips, which need to be investigated with the knowledge of graph theory and combinatorial optimisation. Feedback and suggestions would be much appreciated from the math department. Below is the background of this research.

Nowadays microprocessor development has moved into a new era of many-core on-chip design, with tens or even hundreds of cores fitting within a single processor chip to speed up computing. However, conventional electrical interconnect for inter-core communication is limited by both bandwidth and power density, which creates a performance bottleneck for microchips in modern computer systems - from smartphones to supercomputers, and to large-scale data centers. Optical Network-on-Chip (ONoC), a silicon-based optical interconnection among cores at the chip level, overcomes the limitations of conventional electrical interconnects by supporting greater bandwidth with less energy consumption, and opens the door to bandwidth- and power-hungry applications. This talk will introduce graph-related research problems on ONoCs from a networking perspective and present our current results and challenging problems for designing efficient multicast routing schemes specific for ONoCs.

### Cornelia Schneider

*University Erlangen-Nuremberg*

Date: Tuesday 13 March 2018

### Bernard Deconinck

*University of Washington*

Date: Tuesday 6 March 2018

I will provide an overview of what is known about the stability of spatially periodic water waves, discussing historically significant results, skipping all mathematical details. Then I will introduce different asymptotic models that are used to describe water waves in different regimes (long waves in shallow water, modulated waves in deep water, etc) and I will discuss how the stability results in this context do or do not make sense compared to those in the context of the full water wave problem.

Time permitting, I will give more detail on recent work to understand the stability of modulated waves in deep water with respect to so-called subharmonic perturbations.

### Sarah Wakes

*Centre for Materials Science and Technology*

Date: Tuesday 27 February 2018

Sarah has a BSc (Jt Hons) in Mathematics and Physics and a PhD in Theoretical Mechanics from the University of Nottingham (UK), a chartered engineer in the UK and a chartered member of Engineering NZ.

### Jonny Williams

*National Institute of Water and Atmospheric Research (NIWA)*

Date: Wednesday 15 November 2017

##A joint seminar with the Department of Physics##

Earth System models are able to produce the most advanced computational representations of our planet that we have. They are able to simulate the properties of the atmosphere, ocean and cryosphere as well as biogeochemical processes in the air and in the water. I will give a tour of Earth System models and will discuss their strengths and weaknesses since all models are wrong but some are useful! These models require a lot of computational power and right now we are in the process of replacing New Zealand's supercomputers so I'll discuss these too.

### Tom ter Elst

*University of Auckland*

Date: Tuesday 31 October 2017

The talk is based on a joint work with W Arendt (Ulm).

### Matthew Parry

*Department of Mathematics and Statistics*

Date: Tuesday 24 October 2017

### Rachel Weir

*Allegheny College, Pennsylvania*

Date: Monday 16 October 2017

A common theme in the United States in recent years has been a call to increase the number of graduates in STEM (science, technology, engineering, and mathematics) fields and to enhance the scientific literacy of students in other disciplines. For example, in the 2012 report Engage to Excel, the Obama administration announced a goal of "producing, over the next decade, 1 million more college graduates in STEM fields than expected under current assumptions." Achieving these types of goals will require us to harness the potential of all students, forcing us to identify and acknowledge the barriers encountered by students from traditionally underrepresented groups. Over the past few years, I have been working to understand these barriers to success, particularly in mathematics. In this talk, I will share what I have learned so far and how it has influenced my teaching.

### Gemma Mason

*University of Auckland*

Date: Tuesday 10 October 2017

### Honours and PGDip students

*Department of Mathematics and Statistics*

Date: Friday 6 October 2017

Jodie Buckby : ~~Model checking for hidden Markov models~~

Jie Kang : ~~Model averaging for renewal process~~

Yu Yang : ~~Robustness of temperature reconstruction for the past 500 years~~

MATHEMATICS

Sam Bremer : ~~An effective model for particle distribution in waterways~~

Joshua Mills : ~~Hyperbolic equations and finite difference schemes~~

### Ken Ono

*Emory University; 2017 NZMS/AMS Maclaurin Lecturer*

Date: Thursday 5 October 2017

Ramanujan’s work has had a truly transformative effect on modern mathematics, and continues to do so as we understand further lines from his letters and notebooks. In this lecture, some of the studies of Ramanujan that are most accessible to the general public will be presented and how Ramanujan’s findings fundamentally changed modern mathematics, and also influenced the lecturer’s work, will be discussed. The speaker is an Associate Producer of the film ~~The Man Who Knew Infinity~~ (starring Dev Patel and Jeremy Irons) about Ramanujan. He will share several clips from the film in the lecture.

Biography: Ken Ono is the Asa Griggs Candler Professor of Mathematics at Emory University. He is considered to be an expert in the theory of integer partitions and modular forms. He has been invited to speak to audiences all over North America, Asia and Europe. His contributions include several monographs and over 150 research and popular articles in number theory, combinatorics and algebra. He received his Ph.D. from UCLA and has received many awards for his research in number theory, including a Guggenheim Fellowship, a Packard Fellowship and a Sloan Fellowship. He was awarded a Presidential Early Career Award for Science and Engineering (PECASE) by Bill Clinton in 2000 and he was named the National Science Foundation’s Distinguished Teaching Scholar in 2005. In addition to being a thesis advisor and postdoctoral mentor, he has also mentored dozens of undergraduates and high school students. He serves as Editor-in-Chief for several journals and is an editor of The Ramanujan Journal. He is also a member of the US National Committee for Mathematics at the National Academy of Science.

### Ken Ono

*Emory University; 2017 NZMS/AMS Maclaurin Lecturer*

Date: Thursday 5 October 2017

In 1927 Pólya proved that the Riemann Hypotheses is equivalent to the hyperbolicity of Jensen polynomials for Riemann’s Xi-function. This hyperbolicity has been proved for degrees $d\leq 3$. We obtain an arbitrary precision asymptotic formula for the derivatives $\Xi^{(2n)}(0)$ which allows us to prove the hyperbolicity of 100% of the Jensen polynomials of each degree. We obtain a general theorem which models such polynomials by Hermite polynomials. This theorem also allows us to prove a conjecture of Chen, Jia, and Wang on the partition function.

This is joint work with Michael Griffin, Larry Rolen and Don Zagier.

### Jörg Frauendiener

*Department of Mathematics and Statistics*

Date: Tuesday 26 September 2017

In this talk the origin of the Penrose inequality and some attempts and special cases of its proof will be discussed in more detail.

### Philippe LeFloch

*Université Pierre et Marie Curie*

Date: Tuesday 19 September 2017

This lecture will present recent work on a class of partial differential equations arising in mathematical physics in the context of Einstein's theory of gravity. Specifically, I will consider the question of the nonlinear stability of Minkowski spacetime and I will review the global evolution problem for self-gravitating massive matter. The presentation will kept at an introductory level, accessible to students and non-experts.

### Philippe LeFloch

*Université Pierre et Marie Curie, visiting William Evans fellow*

Date: Wednesday 13 September 2017

Waves surround us, and many technological advances were made possible only because engineers, physicists, and applied mathematicians worked together in order to understand these phenomena. Understanding shock waves was essential to design the modern airliners, which we use to travel. Understanding electro-magnetic waves propagating in space (and time!) was essential to design the GPS global navigation system and allow us to use cell phones. In this lecture, from the perspective of an applied mathematician, I will illustrate with examples the role of mathematics in overcoming practical problems using pioneering works by Leonhard Euler, James Maxwell, and Albert Einstein. Blog: https://philippelefloch.org/

### Melissa Tacy

*Department of Mathematics and Statistics*

Date: Tuesday 12 September 2017

### Richard Norton

*Department of Mathematics and Statistics*

Date: Tuesday 5 September 2017

Markov chain Monte Carlo (MCMC) methods compute a sequence of correlated samples of the random variable, and estimate the expectation by an average over the samples. The error of computing finitely many samples is estimated by computing estimates of the integrated autocorrelation time and variance. Generally, to be accurate, MCMC requires cheap evaluations of the density function.

When the density function is costly (in CPU time) to evaluate then we can try replacing it with a 'proxy' that is cheap to evaluate and perform MCMC on the proxy. But what error does this introduce?

I will present a computable upper bound for this error and apply it to a couple of simple examples.

### Alice Harang

*Department of Marine Science*

Date: Tuesday 22 August 2017

### Markus Antoni

*Department of Mathematics and Statistics*

Date: Tuesday 15 August 2017

\begin{equation*}

d X(t) + A X(t) d t = F(t,X(t)) d t + B(t,X(t)) d β(t)

\end{equation*}

for random fields $X \colon \Omega \times [0,T] \times U \to \mathbb{R}$, where $[0,T]$ is a time interval, $(\Omega,\mathcal{F},\mathbb{P})$ a measure space representing the randomness of the system, and $U$ is typically a domain in $\mathbb{R}^d$ (or again a measure space). We reduce the existence and uniqueness of solutions to a fixed point equation in certain fixed point spaces. To be more precise, we look for mild solutions so that $X(\omega,\cdot,\cdot)$ has values in $L^p(U;L^q[0,T])$ for almost all $\omega \in \Omega$ under appropriate Lipschitz and linear growth conditions on the nonlinearities $F$ and $B$. In contrast to the classical semigroup approach, which gives $X(\omega,\cdot,\cdot) \in L^q([0,T];L^p(U))$, the order of integration is reversed. In combination with concrete examples of stochastic partial differential equations we show that this new approach leads to strong regularity results in particular for the time variable of the random field $X(\omega,t,u)$, e.g.

*pointwise*Hölder estimates for the paths $t \mapsto X(\omega,t,u), \mathbb{P}$-almost surely.