Past

Exponents of Diophantine approximation are defined to study specific sets of real numbers for which Dirichlet's pigeonhole principle can be improved. Khintchine stated a transference principle between the two exponents in the cases  of simultaneous approximation and approximation by linear forms. This shows that exponents of Diophantine approximation are related, and these relations can be studied via so called spectra. In this talk, we provide an optimal bound for the ratio between ordinary and uniform exponents of Diophantine approximation for both simultaneous approximation and approximation by linear forms. This is joint work with Nikolay Moshchevitin.

Abstract:
Highlights:

•We increasingly live in a digital world and commercial companies are not the only beneficiaries. The public sector can also use data to tackle pressing issues.
•Machine learning is starting to make an impact on the tools regulators use, for spotting the bad guys, for estimating demand, and for tackling many other problems.
•The speech uses an array of examples to argue that much regulation is ultimately about recognising patterns in data. Machine learning helps us find those patterns.
 
Just as moving from paper maps to smartphone apps can make us better navigators, Stefan’s speech explains how the move from using traditional analysis to using machine learning can make us better regulators.
 
Mini Biography:
 
Stefan Hunt is the founder and Head of the Behavioural Economics and Data Science Unit. He has led the FCA’s use of these two fields and designed several pioneering economic analyses. He is an Honorary Professor at the University of Nottingham and has a PhD in economics from Harvard University.
 

Superhydrophobic surfaces, formed by air entrapment within the cavities of a hydrophobic solid substrate, offer a promising potential for drag reduction in small-scale flows. It turns out that low-drag configurations are associated with singular limits, which to date have typically been addressed using numerical schemes. I will discuss the application of singular perturbations to several of the canonical problems in the field. 

The development of reduced order models for complex applications, offering the promise for rapid and accurate evaluation of the output of complex models under parameterized variation, remains a very active research area. Applications are found in problems which require many evaluations, sampled over a potentially large parameter space, such as in optimization, control, uncertainty quantification and applications where near real-time response is needed.

However, many challenges remain to secure the flexibility, robustness, and efficiency needed for general large-scale applications, in particular for nonlinear and/or time-dependent problems.

After giving a brief general introduction to reduced order models, we discuss developments in two different directions. In the first part, we discuss recent developments of reduced methods that conserve chosen invariants for nonlinear time-dependent problems. We pay particular attention to the development of reduced models for Hamiltonian problems and propose a greedy approach to build the basis. As we shall demonstrate, attention to the construction of the basis must be paid not only to ensure accuracy but also to ensure stability of the reduced model. Time permitting, we shall also briefly discuss how to extend the approach to include more general dissipative problems through the notion of port-Hamiltonians, resulting in reduced models that remain stable even in the limit of vanishing viscosity and also touch on extensions to Euler and Navier-Stokes equations.

The second part of the talk discusses the combination of reduced order modeling for nonlinear problems with the use of neural networks to overcome known problems of on-line efficiency for general nonlinear problems. We discuss the general idea in which training of the neural network becomes part of the offline part and demonstrate its potential through a number of examples, including for the incompressible Navier-Stokes equations with geometric variations.

This work has been done with in collaboration with B.F. Afkram (EPFL, CH), N. Ripamonti EPFL, CH) and S. Ubbiali (USI, CH).

Given $d \ge 1$, $T>0$ and a vector field $\mathbf b \colon [0,T] \times \mathbb R^d \to \mathbb R^d$, we study the problem of uniqueness of weak solutions to the associated transport equation $\partial_t u + \mathbf b \cdot \nabla u=0$ where $u \colon [0,T] \times \mathbb R^d \to \mathbb R$ is an unknown scalar function. In the classical setting, the method of characteristics is available and provides an explicit formula for the solution of the PDE, in terms of the flow of the vector field $\mathbf b$. However, when we drop regularity assumptions on the velocity field, uniqueness is in general lost.
In the talk we will present an approach to the problem of uniqueness based on the concept of Lagrangian representation. This tool allows to represent a suitable class of vector fields as superposition of trajectories: we will then give local conditions to ensure that this representation induces a partition of the space-time made up of disjoint trajectories, along which the PDE can be disintegrated into a family of 1-dimensional equations. We will finally show that if $\mathbf b$ is locally of class $BV$ in the space variable, the decomposition satisfies this local structural assumption: this yields in particular the renormalization property for nearly incompressible $BV$ vector fields and thus gives a positive answer to the (weak) Bressan's Compactness Conjecture. This is a joint work with S. Bianchini.
 

Tight security is increasingly gaining importance in real-world
cryptography, as it allows to choose cryptographic parameters in a way
that is supported by a security proof, without the need to sacrifice
efficiency by compensating the security loss of a reduction with larger
parameters. However, for many important cryptographic primitives,
including digital signatures and authenticated key exchange (AKE), we
are still lacking constructions that are suitable for real-world deployment.

This talk will present the first first practical AKE protocol with tight
security. It allows the establishment of a key within 1 RTT in a
practical client-server setting, provides forward security, is simple
and easy to implement, and thus very suitable for practical deployment.
It is essentially the "signed Diffie-Hellman" protocol, but with an
additional message, which is crucial to achieve tight security. This
message is used to overcome a technical difficulty in constructing
tightly-secure AKE protocols.

The second important building block is a practical signature scheme with
tight security in a real-world multi-user setting with adaptive
corruptions. The scheme is based on a new way of applying the
Fiat-Shamir approach to construct tightly-secure signatures from certain
identification schemes.

For a theoretically-sound choice of parameters and a moderate number of
users and sessions, our protocol has comparable computational efficiency
to the simple signed Diffie-Hellman protocol with EC-DSA, while for
large-scale settings our protocol has even better computational per-
formance, at moderately increased communication complexity.

Given an endomorphism f:X --> X of a 'dualisable' object in a symmetric monoidal category, one can define its trace Tr(f). It turns out that the trace is 'universal' among the scalars we can produce from f. To prove this we will think of the 1d framed bordism category as the 'walking dualisable object' (using the cobordism hypothesis) and then apply the Yoneda lemma.
Employing similar techniques we can define 'hermitian' objects (generalising hermitian vector spaces) and prove that there is a 1-1 correspondence between Hermitian structures on a fixed object X and self-adjoint automorphisms of X. If time permits I will sketch how this relates to hermitian K-theory.

While all results of the talk hold for infinity-categories, they work equally well for ordinary categories. Therefore no knowledge of higher category theory is needed to follow the talk.

I will report on two recent papers with D. Ghioca and U. Zannier (joined by P. Corvaja and F. Hu, respectively) in which we consider variants of the Mordell-Lang conjecture.  In the first of these, we study the dynamical Mordell-Lang conjecture in positive characteristic, proving some instances, but also showing that in general the problem is at least as hard as a difficult diophantine problem over the integers.  In the second paper, we study the Mordell-Lang problem for extensions of abelian varieties by the additive group.  Here we have positive results in the function field case obtained by using the socle theorem in the form offered as an aside in Hrushovski's 1996 paper and in the number field case we relate this problem to the Bombieri-Lang conjecture.

Part of the series 'What do historians of mathematics do?'

In 1873 the Personal Recollections from Early Life to Old Age of Mary Somerville were published, containing detailed descriptions of her life as a 19th century philosopher, mathematician and advocate of women's rights. In an early draft of this work, Somerville reiterated the widely held view that a fundamental difference between men and women was the latter's lack of originality, or 'genius'.

In my talk I will examine how Somerville's view was influenced by the historic treatment of women, both within scientific research, scientific institutions and wider society. By building on my doctoral research I will also suggest an alternative viewpoint in which her work in the differential calculus can be seen as original, with a focus on her 1834 treatise On the Theory of Differences.

We consider numerical methods for solving  time dependent partial differential equations with convection-diffusion terms and anti-diffusive fractional operator of order $\alpha \in (1,2)$. These equations are motivated by two distinct applications: a dune morphodynamics model and a signal filtering method. 
We propose numerical schemes based on local discontinuous Galerkin methods to approximate the solutions of these equations. Numerical stability and convergence of these schemes are investigated. 
Finally numerical experiments are given to illustrate qualitative behaviors of solutions for both applications and to confirme the convergence results. 

Numerous problems in extremal hypergraph theory ask to determine the maximal size of a k-uniform hypergraph on n vertices that does not contain an 'enlarged' copy H^+ of a fixed hypergraph H. These include well-known  problems such as the Erdős-Sós 'forbidding one intersection' problem and the Frankl-Füredi 'special simplex' problem.

In this talk we present a general approach to such problems, using a 'junta approximation method' that originates from analysis of Boolean functions. We prove that any (H^+)-free hypergraph is essentially contained in a 'junta' -- a hypergraph determined by a small number of vertices -- that is also (H^+)-free, which effectively reduces the extremal problem to an easier problem on juntas. Using this approach, we obtain, for all C<k<n/C, a complete solution of the extremal problem for a large class of H's, which includes  the aforementioned problems, and solves them for a large new set of parameters.

Based on joint works with David Ellis and Nathan Keller
 

We introduce and analyze a discontinuous Galerkin method for the Oseen equations in two dimension spaces. The boundary conditions are mixed and they are assumed to be of three different types:
the vorticity  and the normal component of the velocity are given on a first part of the boundary, the pressure and the tangential component of the velocity are given on a second part of the boundary and the Dirichlet condition is given on the remainder part . We establish a priori error estimates in the energy norm for the velocity and in the L2 norm for the pressure. An a posteriori error estimate is also carried out yielding optimal convergence rate. The analysis is based on rewriting the method in a non-consistent manner using lifting operators in the spirit of Arnold, Brezzi, Cockburn and Marini.

We discuss the recent achievements in the attractors theory for damped wave equations in bounded domains which are related with Strichartz type estimates. In particular, we present the results related with the well-posedness and asymptotic smoothness of the solution semigroup in the case of critical quintic nonlinearity. The non-autonomous case will be also considered.
 

When studying a group, it is natural and often useful to try to cut it up 
onto simpler pieces. Sometimes this can be done in an entirely canonical 
way analogous to the JSJ decomposition of a 3-manifold, in which the 
collection of tori along which the manifold is cut is unique up to isotopy. 
It is a theorem of Brian Bowditch that if the group acts nicely on a metric 
space with a negative curvature property then a canonical decomposition can 
be read directly from the large-scale geometry of that space. In this talk 
we shall explore an algorithmic consequence of this relationship between 
the large-scale geometry of the group and is algebraic decomposition.

I present recently developed iterated residue formulas for tautological integrals over Hilbert schemes of points on  smooth  manifolds. Applications include curve and hypersurface counting formulas. Joint work with Andras Szenes.

 Suppose A is a nice abelian category (such as coherent sheaves coh(X) on a smooth complex projective variety X, or representations mod-CQ of a quiver Q) or T is a nice triangulated category (such as D^bcoh(X) or D^bmod-CQ) over C. Let M be the moduli stack of objects in A or T. Consider the homology H_*(M) over some ring R.
  Given a little extra data on M, for which there are natural choices in our examples, I will explain how to define the structure of a graded vertex algebra on H_*(M). By a standard construction, one can then define a graded Lie algebra from the vertex algebra; roughly speaking, this is a Lie algebra structure on the homology H_*(M^{pl}) of a "projective linear” version M^{pl} of the moduli stack M.
  For example, if we take T = D^bmod-CQ, the vertex algebra H_*(M) is the lattice vertex algebra attached to the dimension vector lattice Z^{Q_0} of Q with the symmetrized intersection form. The degree zero part of the graded Lie algebra contains the associated Kac-Moody algebra.
  The construction appears to be new, but is connected with a lot of work in Geometric Representation Theory, to do with Ringel-Hall-type algebras and their representations, such as the results of Grojnowski-Nakajima on Hilbert schemes. The vertex algebra construction is enormously general, and applies in huge classes of examples. There is a differential-geometric version too.
  The question I am hoping someone in the audience will answer is this: what is the physical interpretation of these vertex algebras?
  It is in some sense an "even Calabi-Yau” construction: when applied to coh(X) or D^bcoh(X), it is most natural for X a Calabi-Yau 2-fold or Calabi-Yau 4-fold, and is essentially trivial for X a Calabi-Yau 3-fold. I discovered it when I was investigating wall-crossing for Donaldson-Thomas type invariants for Calabi-Yau 4-folds. So perhaps one should look for an explanation in the physics of Calabi-Yau 2-folds or 4-folds, with M the moduli space of boundary conditions for the associated SCFT.

DNA computing is emerging as a versatile technology that promises a vast range of applications, including biosensing, drug delivery and synthetic biology. DNA logic circuits can be achieved in solution using strand displacement reactions, or by decision-making molecular robots-so called 'walkers'-that traverse tracks placed on DNA 'origami' tiles.

 Similarly to conventional silicon technologies, ensuring fault-free DNA circuit designs is challenging, with the difficulty compounded by the inherent unreliability of the DNA technology and lack of scientific understanding. This lecture will give an overview of computational models that capture DNA walker computation and demonstrate the role of quantitative verification and synthesis in ensuring the reliability of such systems. Future research challenges will also be discussed.

Leandro Sánchez Betancourt
--------------------------
The Cost of Latency: Improving Fill Ratios in Foreign Exchange Markets

Latency is the time delay between an exchange streaming market data to a trader, the trader processing information and deciding to trade, and the exchange receiving the order from the trader.  Liquidity takers  face  a  moving target problem as a consequence of their latency in the marketplace -- they send marketable orders that aim at a price and quantity they observed in the LOB, but by the time their order was processed by the Exchange, prices (and/or quantities) may have worsened, so the  order  cannot  be  filled. If liquidity taking orders can walk the limit order book (LOB), then orders that arrive late may still be filled at worse prices. In this paper we show how to optimally choose the discretion of liquidity taking orders to walk the LOB. The optimal strategy balances the tradeoff between the costs of walking the LOB and targeting  a desired percentage of filled orders over a period of time.  We employ a proprietary data set of foreign exchange trades to analyze the performance of the strategy. Finally, we show the relationship between latency and the percentage of filled orders, and showcase the optimal strategy as an alternative investment to reduce latency.

Jasdeep Kalsi
-------------
An SPDE model for the Limit Order Book

I will introduce a microscopic model for the Limit Order Book in a static setting i.e. in between price movements. Here, order flow at different price levels is given by Poisson processes which depend on the relative price and the depth of the book. I will discuss how reflected SPDEs can be obtained as scaling limits of such models. This motivates an SPDE with reflection and a moving boundary as a model for the dynamic Order Book. An outline for how to prove existence and uniqueness for the equation will be presented, as well as some simple simulations of the model.

Steady state chemical reaction models can be thought of as algebraic varieties whose properties are determined by the network structure. In experimental set-ups we often encounter the problem of noisy data points for which we want to find the corresponding steady state predicted by the model. Depending on the network there may be many such points and the number of which is given by the euclidean distance degree (ED degree). In this talk I show how certain properties of networks relate to the ED degree and how the runtime of numerical algebraic geometry computations scales with the ED degree.

Let $P$ be a random polynomial of degree $d$ such that the leading and constant coefficients are 1 and the rest of the coefficients are independent random variables taking the value 0 or 1 with equal probability. Odlyzko and Poonen conjectured that $P$ is irreducible with probability tending to 1 as $d$ grows.  I will talk about an on-going joint work with Emmanuel Breuillard, in which we prove that GRH implies this conjecture. The proof is based on estimates for the mixing time of random walks on $\mathbb{F}_p$, where the steps are given by the maps $x \rightarrow ax$ and $x \rightarrow ax+1$ with equal probability.

Title: Generalized McKean-Vlasov stochastic control problems.

Abstract: I will consider McKean-Vlasov stochastic control problems 
where the cost functions and the state dynamics depend upon the joint 
distribution of the controlled state and the control process. First, I 
will provide a suitable version of the Pontryagin stochastic maximum 
principle, showing that, in the present general framework, pointwise 
minimization of the Hamiltonian with respect to the control is not a 
necessary optimality condition. Then I will take a different 
perspective, and present a variational approach to study a weak 
formulation of such control problems, thereby establishing a new 
connection between those and optimal transport problems on path space.

The talk is based on a joint project with J. Backhoff-Veraguas and R. Carmona.

Elastic gridshells arise from the buckling of an initially planar grid of rods. Architectural elastic gridshells first appeared in the 1970’s. However, to date, only a limited number of examples have been constructed around the world, primarily due to the challenges involved in their structural design. Yet, elastic gridshells are highly appealing: they can cover wide spans with low self-weight, they allow for aesthetically pleasing shapes and their construction is typically simple and rapid. A more mundane example is the classic pasta strainer, which, with its remarkably simple design, is a must-have in every kitchen.

This talk will focus on the geometry-driven nature of elastic gridshells. We use a geometric model based on the theory of discrete Chebyshev nets (originally developed for woven fabric) to rationalize their actuated shapes. Validation is provided by precision experiments and rod-based simulations. We also investigate the linear mechanical response (rigidity) and the non-local behavior of these discrete shells under point-load indentation. Combining experiments, simulations, and scaling analysis leads to a master curve that relates the structural rigidity to the underlying geometric and material properties. Our results indicate that the mechanical response of elastic gridshells, and their underlying characteristic forces, are dictated by Euler's elastica rather than by shell-related quantities. The prominence of geometry that we identify in elastic gridshells should allow for our results to transfer across length scales: from architectural structures to micro/nano–1-df mechanical actuators and self-assembly systems.

[[{"fid":"51243","view_mode":"small_image_100px_h","fields":{"format":"small_image_100px_h","field_file_image_alt_text[und][0][value]":"","field_file_image_title_text[und][0][value]":""},"type":"media","attributes":{"class":"media-element file-small-image-100px-h"}}]]

In this talk we will introduce and analyse a class of robust numerical methods for nonlocal possibly nonlinear diffusion and convection-diffusion equations. Diffusion and convection-diffusion models are popular in Physics, Chemistry, Engineering, and Economics, and in many models the diffusion is anomalous or nonlocal. This means that the underlying “particle" distributions are not Gaussian, but rather follow more general Levy distributions, distributions that need not have second moments and can satisfy (generalised) central limit theorems. We will focus on models with nonlinear possibly degenerate diffusions like fractional Porous Medium Equations, Fast Diffusion Equations, and Stefan (phase transition) Problems, with or without convection. The solutions of these problems can be very irregular and even possess shock discontinuities. The combination of nonlinear problems and irregular solutions makes these problems challenging to solve numerically.
The methods we will discuss are monotone finite difference quadrature methods that are robust in the sense that they “always” converge. By that we mean that under very weak assumptions, they converge to the correct generalised possibly discontinuous generalised solution. In some cases we can also obtain error estimates. The plan of the talk is: 1. to give a short introduction to the models, 2. explain the numerical methods, 3. give results and elements of the analysis for pure diffusion equations, and 4. give results and ideas of the analysis for convection-diffusion equations. 
 

In 2012 Eskin, Fisher and Whyte proved there was a locally finite vertex transitive graph which was not quasi-isometric to any connected locally finite Cayley Graph. This motivates the study of vertex transitive graphs from a geometric group theory point of view. We will discus how concepts and problems from group theory generalise to this setting. Constructing one framework in which problems can be framed so that techniques from group theory can be applied. This is work in progress with Agelos Georgakopoulos.

TBA

Part of the series 'What do historians of mathematics do?'

In this talk, we will survey the movement of mathematical ideas in the 17th century. We will explore, in particular, the mathematical cultures of Paris, Amsterdam, Rome, Cape Town, Goa, Kyoto, Beijing, and London, as well as the journey of mathematical knowledge on a global scale. As it will be an ambitious task to complete a round-the-world history tour in an hour, the focus will be on East Asia. By employing the digital humanities technique, this presentation will use digital media to effectively show historical sources and help the audience imagine the world as a “round” entity when we discuss a global history of mathematics.

I will present a variation of positive model theory which addresses the issues of approximations of conventional geometric structures by sequences of Zariski structures as well as approximation by sequences of finite structures. In particular I am interested in applications to quantum mechanics.

I will report on a progress in defining and calculating oscillating in- tegrals of importance in quantum physics. This is based on calculating Gauss sums of order higher or equal to 2 over rings Z/mZ for very specific m. 

Some natural moduli problems give rise to stacks with infinite stabilizers. I will report on recent work with Dan Edidin where we give a canonical sequence of saturated blow-ups that makes the stabilizers finite. This generalizes earlier work in GIT by Kirwan and Reichstein, and on toric stacks by Edidin-More. Time permitting, I will also mention a recent application to generalized Donaldson-Thomas invariants by Kiem-Li-Savvas.

We construct a space of vector fields that are normal to differentiable curves in the plane. Its basis functions are defined via saddle point variational problems in reproducing kernel Hilbert spaces (RKHSs). First, we study the properties of these basis vector fields and show how to approximate them. Then, we employ this basis to discretise shape Newton methods and investigate the impact of this discretisation on convergence rates.

We prove that the dimension of every poset whose comparability graph has maximum degree $\Delta$ is at most $\Delta\log^{1+o(1)} \Delta$. This result improves on a 30-year old bound of F\"uredi and Kahn, and is within a $\log^{o(1)}\Delta$ factor of optimal. We prove this result via the notion of boxicity. The boxicity of a graph $G$ is the minimum integer $d$ such that $G$ is the intersection graph of $d$-dimensional axis-aligned boxes. We prove that every graph with maximum degree $\Delta$ has boxicity at most $\Delta\log^{1+o(1)} \Delta$, which is also within a $\log^{o(1)}\Delta$ factor of optimal. We also show that the maximum boxicity of graphs with Euler genus $g$ is $\Theta(\sqrt{g \log g})$, which solves an open problem of Esperet and Joret and is tight up to a $O(1)$ factor. This is joint work with Alex Scott (arXiv:1804.03271).

Structure from Motion (SfM) is a problem which asks: given photos of an object from different angles, can we reconstruct the object in 3D? This problem is important in computer vision, with applications including urban planning and autonomous navigation. A key part of SfM is bundle adjustment, where initial estimates of 3D points and camera locations are refined to match the images. This results in a high-dimensional nonlinear least-squares problem, which is typically solved using the Gauss-Newton method. In this talk, I will discuss how dimensionality reduction methods such as block coordinates and randomised sketching can be used to improve the scalability of Gauss-Newton for bundle adjustment problems.

Over the past decade, the randomized singular value decomposition (RSVD)
algorithm has proven to be an efficient, reliable alternative to classical
algorithms for computing low-rank approximations in a number of applications.
However, in cases where no information is available on the singular value
decay of the data matrix or the data matrix is known to be close to full-rank,
the RSVD is ineffective. In recent years, there has been great interest in
randomized algorithms for computing full factorizations that excel in this
regime.  In this talk, we will give a brief overview of some key ideas in
randomized numerical linear algebra and introduce a new randomized algorithm for
computing a full, rank-revealing URV factorization.

I will present a procedure for perturbatively constructing the field content of gravitational theories from a convolutive product of two Yang-Mills theories. A dictionary "gravity=YM * YM" is developed, reproducing the symmetries and dynamics of the gravity theory from those of the YM theories. I will explain the unexpected, yet crucial role played by the BRST ghosts of the YM system in the construction of gravitational fields. The dictionary is expected to develop into a solution-generating technique for gravity.
 

Wikipedia has more than 40 million articles in 280 languages. It represents a decent coverage of human knowledge.
Even with its biases it can tell us a lot about what's important for people. London has an article in 238 languages and
Swansea has in 73 languages. Is London more "culturally" important than Swansea? Probably. 
We use this information and look at various factors that could help us model "cultural" importance of a city and hence
try to find the driving force behind sister city relationships.
We also look at creating cultural maps of different cities, finding the artsy/hipster, academic, political neighbourhoods of a city.

Hilbert's 19th problem asks if minimizers of "natural" variational integrals are smooth. For the past century, this problem inspired fundamental regularity results for elliptic and parabolic PDES. It also led to the construction of several beautiful counterexamples to regularity. The dichotomy of regularity vs. singularity is related to that of single PDE (the scalar case) vs. system of PDEs (the vectorial case), and low dimension vs. high dimension. I will discuss some interesting recent counterexamples to regularity in low-dimensional vectorial cases, and outstanding open problems. Parts of this are joint works with A. Figalli and O. Savin.

Stochastic analysis on a Riemannian manifold is a well developed area of research in probability theory.

We will discuss some recent developments on stochastic analysis on a manifold whose Riemannian metric evolves with time, a typical case of which is the Ricci flow. Familiar results such as stochastic parallel transport, integration by parts formula, martingale representation theorem, and functional inequalities have interesting extensions from

time independent metrics to time dependent ones. In particular, we will discuss an extension of Beckner’s inequality on the path space over a Riemannian manifold with time-dependent metrics. The classical version of this inequality includes the Poincare inequality and the logarithmic Sobolev inequality as special cases.

I will prove that the knot Floer homology group
HFK-hat(K, g-1) for a genus g fibered knot K is isomorphic to a
variant of the fixed points Floer homology of an area-preserving
representative of its monodromy. This is a joint work with Gilberto
Spano.
 

A C^infinity scheme is a version of a scheme that uses a maximal spectrum. The category of C^infinity schemes contains the category of Manifolds as a full subcategory, as well as being closed under fibre products. In other words, this category is equipped to handle intersection singularities of smooth spaces.

While originally defined in the set up of Synthetic Differential Geometry, C^infinity schemes have more recently been used to describe derived manifolds, for example, the d-manifolds of Joyce. There are applications of this in Symplectic Geometry, such as the describing the moduli space of J-holomorphic forms.

In this talk, I will describe the category of C^infinity schemes, and how this idea can be extended to manifolds with corners. If time, I will mention the applications of this in derived geometry.

The signature of a parametric curve is a sequence of tensors whose entries are iterated integrals, and they are central to the theory of rough paths in stochastic analysis.  For some special families of curves, such as polynomial paths and piecewise-linear paths, their parametrized signature tensors trace out algebraic varieties in the space of all tensors. We introduce these varieties and examine their fundamental properties, while highlighting their intimate connection to the problem of recovering a path from its signature. This is joint work with Peter Friz and Bernd Sturmfels. 

I will overview my research for a general math audience.

 First I will present the biological questions and motivate why systems biology needs computational algebraic biology and topological data analysis. Then I will present the mathematical methods I've developed to study these biological systems. Throughout I will provide examples.

Jan Sbierski

Title: On the unique evolution of solutions to wave equations

Abstract: An important aspect of any physical theory is the ability to predict the future of a system in terms of an initial configuration. This talk focuses on wave equations, which underlie many physical theories. We first present an example of a quasilinear wave equation for which unique predictability in fact fails and then turn to conditions which guarantee predictability. The talk is based on joint work with Felicity Eperon and Harvey Reall.

Andrew Krause

Title: Surprising Dynamics due to Spatial Heterogeneity in Reaction-Diffusion Systems

Abstract: Since Turing's original work, Reaction-Diffusion systems have been used to understand patterning processes during the development of a variety of organisms, as well as emergent patterns in other situations (e.g. chemical oscillators). Motivated by understanding hair follicle formation in the developing mouse, we explore the use of spatial heterogeneity as a form of developmental tuning of a Turing pattern to match experimental observations of size and wavelength modulation in embryonic hair placodes. While spatial heterogeneity was nascent in Turing's original work, much work remains to understand its effects in Reaction-Diffusion processes. We demonstrate novel effects due to heterogeneity in two-component Reaction-Diffusion systems and explore how this affects typical spatial and temporal patterning. We find a novel instability which gives rise to periodic creation, translation, and destruction of spikes in several classical reaction-diffusion systems and demonstrate that this periodic spatiotemporal behaviour appears robustly away from Hopf regimes or other oscillatory instabilities. We provide some evidence for the universal nature of this phenomenon and use it as an exemplar of the mostly unexplored territory of explicit heterogeneity in pattern formation.
 

Classical work of Jeffery from 1922 established how at low Reynolds number, ellipsoids in steady shear flow undergo periodic motion with non-uniform rotation rate, termed 'Jeffery orbits'.  I will present two problems where Jeffery orbits play a critical role in understanding the transport and aggregation of rod-shaped organisms.  I will discuss the trapping of motile chemotactic bacteria in high shear, and the sedimentation rate of negatively buoyant plankton. 

In this talk I will present a unified approach for the effect of fast rotation and dispersion as an averaging mechanism for, on the one hand, regularizing and stabilizing certain evolution equations, such as the Navier-Stokes and Burgers equations. On the other hand, I will  also present some results in which large dispersion acts as a destabilizing mechanism for the long-time dynamics of certain dissipative evolution equations, such as the Kuramoto-Sivashinsky equation. In addition, I will present some new results concerning two- and three-dimensional turbulent flows with high Reynolds numbers in periodic domains, which exhibit ``Landau-damping" mechanism due to large spatial average in the initial data.

Single parameter persistent homology has proven to be a useful data analytic tool and single parameter persistence modules enjoy a concise description as a barcode, a complete invariant. [Bubenik, 2012] derived a topological summary closely related to the barcode called the persistence landscape which is amenable to statistical analysis and machine learning techniques.

The theory of multidimensional persistence modules is presented in [Carlsson and Zomorodian, 2009] and unlike the single parameter case where one may associate a barcode to a module, there is not an analogous complete discrete invariant in the multiparameter setting. We propose an incomplete invariant derived from the rank invariant associated to a multiparameter persistence module, which generalises the single parameter persistence landscape in [Bubenik, 2012] and satisfies similar stability properties with respect to the interleaving distance. Our invariant naturally lies in a Banach Space and so is naturally endowed with a distance function, it is also well suited to statistical analysis since there is a uniquely defined mean associated to multiple landscapes. We shall present computational examples in the 2-parameter case using the RIVET software presented in [Lesnick and Wright, 2015].