– 10:00-10:30:

Abstract: Functional programmers (especially the Haskell ones) are obsessed with making their functions pure, so they resemble mathematical (partial) functions. The most common way effectful code is written in Haskell is by using monads. In this talk, I will show how recent developments in the research of graded monads can be used to automatically verify useful properties of programs.

– 10:40-11:10:

The explicit rank of the group of rational points of an elliptic curve is a center of interest in computational number theory. This is because the ranks are closely related to explicit rational solutions to certain algebraic equations. One common method of obtaining an upper bound for the rank is via the descent calculation.

This talk begins with an introduction to elliptic curves and descent calculation. We will explore how the descent calculation can bound the rank of elliptic curves. In the end, we will briefly discuss some generalisation of this method.

– 11:20-11:50:

Signal processing strategies and statistics for identifying the presence of evolution in continuous signals is investigated. Consider a feature to be a function on the original signal which contains information about the signal. Under this framework, a model for multivariate Gaussian features observed across related signals is described. The model considers the possibility that some features in the signal are tree amenable while others are not. A model for identifying candidate features using wavelet transforms is also described. Tree amenability is then explored from the perspective of data thresholding. Because of the high type-1 and type-2 error rates of know tests for Gaussian tree amenability, a measure of how tree amenable a feature is has been developed. A methodology is proposed for reconstructing only the tree amenable components of a signal to improve interoperability of the model. Rigorous statistical methods are then defined to test for both tree amenability as well as general structure in the data. To test and better understand these methods, strategies are described to randomly generate tree amenable data.

– 12:00-12:30:

The Hales-Jewett theorem for alphabet of size 3 states that whenever the cube {1, 2, 3}^n is r-coloured there exists a monochromatic line for n large. Given a line l, the set of active coordinates of l is the set of those coordinates that are allowed to vary. In this talk I will consider the following question: given r, what is the smallest number t so that for any r-colouring of [3]^n (n large) there exists a monochromatic line whose active set of coordinates is an union of at most t intervals.

– 12:40-14:00:

Lunch Break

– 14:10-14:40:

It is well understood that in quantum fluidic systems, rotational flows are restricted to quantized vortex singularities. However, despite being predicted to have extraordinary scientific and technological potential, due to dynamical instabilities, quantized vortices of higher-than-unit topological charge have remained elusive. Here, I show that the steady-state fluxes inherent to nonconservative quantum fluids allow for the spontaneous formation of stable quantum vortices of high topological charge.

– 14:50-15:20:

Swimming, flying, crawling, hopping, gliding, ballooning, cartwheeling… the list could go on. Nature displays an astonishing diversity when it comes to locomotion. In this talk, I will give some examples of interesting locomotion starting from the animal kingdom and ending with the swimming of bacteria, which is the topic of my research. Along the way, I will highlight the role of physics and mathematics in understanding locomotion, and I will refer to some recent research done on this topic.

– 15:30-16:00:

Charges of particles have to be integers. A careful study reveals that for quantum field theory to be consistent, these charges must obey certain sets of polynomial equations. We’ll look at how this plays out beautifully in the Standard Model, and at appearances of discrete mathematics in other related contexts.