# Seminar Archive - 2018

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.

Dan Altman - UNSW
Consider the problem of factorising a degree n polynomial over F_p. Randomised algorithms whose complexities are polynomial in n and log p date back half a century. The salient open problem in the...

Dzmitry Badziahin - University of Sydney
Winning sets were initially introduced by W. Schmidt. He used them to solve several problems in Diophantine approximation about the structure of the so called badly approximable sets. Schmidt winning...

Donna Salopek - School of Mathematics & Statistics, UNSW Sydney
Each week Donna Salopek and a team of undergraduate student mathematics ambassadors travel to Matraville Sports High School to encourage/help these students with their maths. In this seminar we will...

Howard Bondell - University of Melbourne
In this talk, we discuss two projects tangentially related under the umbrella of high‐dimensional regression. The first part of the talk investigates informative missingness in the framework of...

Prof N J Wildberger - School of Mathematics and Statistics, UNSW
The Derivative arguably first appeared in mathematics in the 1631 work of Johann Faulhaber, who used it to establish remarkable relations between sums of kth powers of natural numbers, extending...

Debopriya Mukherjee - UNSW, Sydney.
I will discuss about the existence of a solution to an optimal relaxed control problem for the linearly-coupled viscoelastic Oldroyd-B model driven by Levy noise. Then, the existence and uniqueness...

Jessica Dai - University of New South Wales
Various parameters of a linear code, such as its minimum weight and minimum distance, provide information about its error-detecting and error-correcting capabilities. In 1963, MacWilliams proved her...

Madeleine Kyng - University of New South Wales
The zeta function of a curve defined over a finite field is a generating function which encodes arithmetic and geometric information about the curve. An important problem in computational number...

Joseph Rosenblatt - Indiana University-Purdue University Indianapolis, University of Illinois Urbana-Champaign
I will describe the basic goals of quantization and how we might use random, Diophantine, and dynamical processes to construct good quantization. This leads naturally to questions about shrinking...

Alan Stoneham - University of New South Wales
Toeplitz operators generalise matrices which are constant on diagonals. There is a well-developed theory of these operators, particularly when acting on the Hardy space $H^2(T)$ which might be...