Past Forthcoming Seminars

16 February 2018
14:00
Abstract

Bacteria swim by rotating semi-rigid helical flagellar filaments, using an ion driven rotary motor embedded in the membrane. Bacteria are too small to sense a spatial gradient and therefore sense changes in time, and use the signals to bias their direction changing pattern to bias overall swimming towards a favourable environment. I will discuss how interdisciplinary research has helped us understand both the mechanism of motor function and its control by chemosensory signals.

Please see https://www.eventbrite.co.uk/e/qbiox-colloquium-dunn-school-seminar-hila...

for details.

  • Mathematical Biology and Ecology Seminar
15 February 2018
16:00
Carol Alexander
Abstract

Our general theory, which encompasses two different aggregation properties (Neuberger, 2012; Bondarenko, 2014) establishes a wide variety of new, unbiased and efficient risk premia estimators. Empirical results on meticulously-constructed daily, investable, constant-maturity  S&P500 higher-moment premia reveal significant, previously-undocumented, regime-dependent behavior. The variance premium is fully priced by Fama and French (2015) factors during the volatile regime, but has significant negative alpha in stable markets.  Also only during stable periods, a small, positive but significant third-moment premium is not fully priced by the variance and equity premia. There is no evidence for a separate fourth-moment premium.

  • Mathematical and Computational Finance Seminar
15 February 2018
16:00
Alexandra Florea
Abstract

I will talk about some recent work with Chantal David and Matilde Lalin about the mean value of L-functions associated to cubic characters over F_q[t] when q=1 (mod 3). I will explain how to obtain an asymptotic formula with a (maybe a little surprising) main term, which relies on using results from the theory of metaplectic Eisenstein series about cancellation in averages of cubic Gauss sums over functions fields.

  • Number Theory Seminar
15 February 2018
16:00
to
17:30
Abstract

A polymer, or microscopic elastic filament, is often modelled as a linear chain of rigid bodies interacting both with themselves and a heat bath. Then the classic notions of persistence length are related to how certain correlations decay with separation along the chain. I will introduce these standard notions in mathematical terms suitable for non specialists, and describe the standard results that apply in the simplest cases of wormlike chain models that have a straight, minimum energy (or ground or intrinsic) shape. Then I will introduce an appropriate  splitting of a matrix recursion in the group SE(3) which deconvolves the distinct effects of stiffness and intrinsic shape in the more complicated behaviours of correlations that arise when the polymer is not intrinsically straight. The new theory will be illustrated by fully implementing it within a simple sequence-dependent rigid base pair model of DNA. In that particular context, the persistence matrix factorisation generalises and justifies the prior scalar notions of static and dynamic persistence lengths.

  • Industrial and Applied Mathematics Seminar
15 February 2018
14:00
Anna-Karin Tornberg
Abstract

In micro-fluidics, at small scales where inertial effects become negligible, surface to volume ratios are large and the interfacial processes are extremely important for the overall dynamics. Integral
equation based methods are attractive for the simulations of e.g. droplet-based microfluidics, with tiny water drops dispersed in oil, stabilized by surfactants. In boundary integral formulations for
Stokes flow, jumps in pressure and velocity gradients are naturally taken care of, viscosity ratios enter only in coefficients of the equations, and only the drop surfaces must be discretized and not the volume inside nor in between.

We present numerical methods for drops with insoluble surfactants, both in two and three dimensions. We discretize the integral equations using Nyström methods, and special care is taken in the evaluation of singular and also nearly singular integrals that is needed in the case of close drop interactions. A spectral method is used to solve the advection-diffusion equation on each drop surface that describes the evolution of surfactant concentration. The drop velocity and surfactant concentration couple together through an equation of state for the surface tension coefficient. An adaptive time-stepping strategy is developed for the coupled problem, with the constraint to minimize the number of Stokes solves, since this is the computationally most expensive part.

For high quality discretization of the drops throughout the simulations, a hybrid method is used in two dimensions, offering an arc-length parameterization of the interface. In three dimensions, a
reparameterization procedure is developed to optimize the spherical harmonics representation of the drop, while conserving the drop volume and amount of surfactant.

We present results from some validation tests and illustrate the ability of the numerical methods in different challenging problems.

  • Computational Mathematics and Applications Seminar
15 February 2018
12:00
Michele Coti Zelati
Abstract

The basic mathematical models that describe the behavior of fluid flows date back to the eighteenth century, and yet many phenomena observed in experiments are far from being well understood from a theoretical viewpoint. For instance, especially challenging is the study of fundamental stability mechanisms when weak dissipative forces (generated, for example, by molecular friction) interact with advection processes, such as mixing and stirring. The goal of this talk is to have an overview on recent results on a variety of aspects related to hydrodynamic stability, such as the stability of vortices and laminar flows, the enhancement of dissipative force via mixing, and the statistical description of turbulent flows.

  • PDE CDT Lunchtime Seminar
14 February 2018
15:00
Abstract

Multivariate cryptography is one of a handful of proposals for post-quantum cryptographic schemes, i.e. cryptographic schemes that are secure also against attacks carried on with a quantum computer. Their security relies on the assumption that solving a system of multivariate (quadratic) equations over a finite field is computationally hard. 

Groebner bases allow us to solve systems of polynomial equations. Therefore, one of the key questions in assessing the robustness of multivariate cryptosystems is estimating how long it takes to compute the Groebner basis of a given system of polynomial equations. 

After introducing multivariate cryptography and Groebner bases, I will present a rigorous method to estimate the complexity of computing a Groebner basis. This approach is based on techniques from commutative algebra and is joint work with Alessio Caminata (University of Barcelona).

 
  • Cryptography Seminar

Pages