Past

Dynamics of small particles in fluids have fascinated scientists for centuries. Phenomena such as Brownian motion, sedimentation, and electrophoresis continue to inspire cutting-edge research and innovations. The fluid in which the particles move is typically isotropic, such as water or a polymer solution. Recently, we started to explore what would happen if particles are placed in an anisotropic fluid: a liquid crystal. The study reveals that the liquid crystal changes dramatically both the statics and dynamics, leading to levitation of the particles, their anomalous Brownian motion and new mechanisms of electrokinetics. The new phenomena are rooted in anisotropy of the liquid crystal properties, such as different electric conductivity in the directions parallel and perpendicular to the average molecular orientation.

We will give an outline of the proof by Kahn and Markovic who showed that a closed hyperbolic 3-manifold $\textbf{M}$ contains a closed $\pi_1$-injective surface. This is done using exponential mixing to find many pairs of pants in $\textbf{M}$, which can then be glued together to form a suitable surface. This answers a long standing conjecture of Waldhausen and is a key ingredient in the proof of the Virtual Haken Theorem.

Cluster algebras are commutative algebras generated by a set S, obtained by an iterated mutation process of an initial seed. They were introduced by S. Fomin and A. Zelevinski in connection with canonical bases in Lie theory. Since then, many connections between cluster algebras and other areas have arisen.
This talk will focus on cluster algebras for which the set S is finite. These are called cluster algebras of finite type and are classified by Dynkin diagrams, in a similar way to many other objects.

http://hottformath.wikispaces.com

 In a previous work, we introduced a refinement of Juhasz’s sutured Floer homology, and constructed a minus theory for sutured manifolds, called sutured Floer chain complex. In this talk, we introduce a new description of sutured manifolds as “tangles” and describe a notion of cobordism between them. Using this construction, we define a cobordism map between the corresponding sutured Floer chain complexes. We also discuss some possible applications. This is a joint work with Eaman Eftekhary.

Rational Krylov subspaces have been proven to be useful for many applications, like the approximation of matrix functions or the solution of matrix equations. It will be shown that extended and rational Krylov subspaces —under some assumptions— can be retrieved without any explicit inversion or system solves involved. Instead we do the necessary computations of $A^{-1} v$ in an implicit way using the information from an enlarged standard Krylov subspace.

It is well-known that both for classical and extended Krylov spaces, direct unitary similarity transformations exist providing us the matrix of recurrences. In practice, however, for large dimensions computing time is saved by making use of iterative procedures to gradually gather the recurrences in a matrix. Unfortunately, for extended Krylov spaces one is required to frequently solve, in some way or another a system of equations. In this talk both techniques will be integrated. We start with an orthogonal basis of a standard Krylov subspace of dimension $m+m+p$. Then we will apply a unitary similarity built by rotations compressing thereby significantly the initial subspace and resulting in an orthogonal basis approximately spanning an extended or rational Krylov subspace.

Numerical experiments support our claims that this approximation is very good if the large Krylov subspace contains $A^{-(m+1)} v$, …, $A^{-1} v$ and thus can culminate in nonneglectable dimensionality reduction and as such also can lead to time savings when approximating, e.g., matrix functions.

Gyárfás conjectured in 1985 that if $G$ is a graph with no induced cycle of odd length at least 5, then the chromatic number of $G$ is bounded by a function of its clique number.  We prove this conjecture.  Joint work with Paul Seymour.

A stable algorithm to compute the roots of polynomials is presented. The roots are found by computing the eigenvalues of the associated companion matrix by Francis's implicitly-shifted $QR$ algorithm.  A companion matrix is an upper Hessenberg matrix that is unitary-plus-rank-one, that is, it is the sum of a unitary matrix and a rank-one matrix.  These properties are preserved by iterations of Francis's algorithm, and it is these properties that are exploited here. The matrix is represented as a product of $3n-1$ Givens rotators plus the rank-one part, so only $O(n)$ storage space is required.  In fact, the information about the rank-one part is also encoded in the rotators, so it is not necessary to store the rank-one part explicitly.  Francis's algorithm implemented on this representation requires only $O(n)$ flops per iteration and thus $O(n^{2})$ flops overall.  The algorithm is described, backward stability is proved under certain conditions on the polynomial coefficients, and an extensive set of numerical experiments is presented.  The algorithm is shown to be about as accurate as the (slow) Francis $QR$ algorithm applied to the companion matrix without exploiting the structure.  It is faster than other fast methods that have been proposed, and its accuracy is comparable or better.

In this talk I will present several results connected with the idea of magnetic relaxation for MHD, including some new commutator estimates (and a counterexample to the estimate in the critical case). (Joint work with various subsets of  D. McCormick, J. Robinson, C. Fefferman and J-Y. Chemin.)

Cramer conjectured a random model for the distribution of the primes, which would suggest that, on the scale of the average prime gap, the primes can be modelled by a Poisson process. In particular, the set of limit points of normalized prime gaps would be the whole interval $[0,\infty)$. I will describe joint work with Banks and Freiberg which shows that at least 1/8 of the positive reals are in the set of limit points. 

I will describe the Spatial Lambda-Fleming-Viot process, which is a model of evolution in a spatial continuum, and discuss the time and spatial scales on which selectively advantageous genes propagate through space. The appropriate scaling depends on the dimension of space, resulting in three distinct cases; d=1, d=2 and d>=3. In d=1 the limiting genealogy is the Brownian net whereas, by contrast, in d=2 local interactions give rise to a delicate damping mechanism and result in a finite limiting branching rate. This is joint work with Alison Etheridge and Daniel Straulino.

 Parametrized spectra are topological objects that represent
twisted forms of cohomology theories.  In this talk I will describe a theory
of parametrized spectra as highly structured bundle-like objects.  In
particular, we can make sense of the structure "group" of a bundle of
spectra.  This point of view leads to new examples and a good framework for
twisted equivariant cohomology theories.  

The theory of regularity structures allows one to give a meaning to several stochastic PDEs, including the Parabolic Anderson Model. So far, these equations have been considered on a torus. The goal of this talk is to explain how one can define the PAM on the whole space R^3. This is a joint work with Martin Hairer.

When firms want to buy back their own shares, they often use the services of investment banks through ASR contracts. ASR contracts are execution contracts including exotic option characteristics (an Asian-type payoff and Bermudian/American exercise dates). In this talk, I will present the different types of ASR contracts usually encountered, and I will present a model in order to (i) price ASR contracts and (ii) find the optimal execution strategy for each type of contract. This model is inspired from the classical (Almgren-Chriss) literature on optimal execution and uses classical ideas from option pricing. It can also be used to price options on illiquid assets. Original numerical methods will be presented.

1. Calibration and Pricing of Financial Derivatives using Forward PDEs (Mariapragassam)

Nowadays, various calibration techniques are in use in the financial industry and the exact re-pricing of call options is a must-have standard. However, practitioners are increasingly interested in taking into account the quotes of other derivatives as well.
We describe our approach to the calibration of a specific Local-Stochastic volatility model proposed by the FX group at BNP Paribas. We believe that forward PDEs are powerful tools as they allow to achieve stable and fast best-fit routines. We will expose our current results on this matter.

Joint work with Prof. Christoph Reisinger

2. Infinite discrete-time investment and consumption problem (Li)

We study the investment and consumption problem in infinite discrete-time framework. In our problem setting, we do not need the wealth process to be positive at any time point. We first analyze the time-consistent case and give the convergence of value function for infinite-horizon problem by value functions of finite-horizon problems.

Then we discuss the time-consistent case, and hope the value functions of finite-horizon problems will still converge to the infinite-horizon problem.

I'll discuss work (part with Savitt, part with Dembele and Roberts) on two related questions: describing local factors at primes over p in mod p automorphic representations, and describing reductions of local crystalline Galois representations with prescribed Hodge-Tate weights.

In this talk we want to discuss results by Dimca, Papadima, and Suciu about the finiteness properties of Kähler groups. Namely, we will sketch their proof that for every $2\leq n\leq \infty$ there is a Kähler group with finiteness property $\mathcal{F}_n$, but not $FP_{n+1}$. Their proof is by explicit construction of examples. These examples all arise as subgroups of finite products of surface groups and they are the first known examples of Kähler groups with arbitrary finiteness properties. The talk does not require any prior knowledge of finiteness properties or of Kähler groups.

LiFePO4 is a commercially available battery material with good theoretical discharge capacity, excellent cycle life and increased safety compared with competing Li-ion chemistries. During discharge, LiFePO4 material can undergo phase separation, between a highly and lowly lithiated form. Discharge of LiFePO4 crystals has traditionally been modelled by one-phase Stefan problems, which assume that phase separation occurs.

Recent work has been using phase-field models based on the Cahn-Hilliard equation, which only phase-separates when thermodynamically favourable. In the past year or two, this work has been having considerable impact in both theoretical and experimental electrochemistry.

Unfortunately, these models are very difficult to solve numerically and involve large, coupled systems of nonlinear PDEs across several different size scales that include a range of different physics and cannot be homogenised effectively.

This talk will give an overview of recent developments in modelling LiFePO4 and the sort of strategies used to solve these systems numerically.

I shall show that for every conjugacy class O in a connected semisimple algebraic group G over an algebraically closed field of characteristic good for G one can find a special transversal slice S to the set of conjugacy classes in G such that O intersects S and dim O=codim S. The construction of the slice utilizes some new combinatorics related to invariant planes for the action of Weyl group elements in the reflection representation. The condition dim O=codim S is checked using some new mysterious results by Lusztig on intersection of conjugacy classes in algebraic groups with Bruhat cells.

We outline a path from polynomial numerical hulls to multicentric calculus for evaluating f(A). Consider
$$Vp(A) = {z ∈ C : |p(z)| ≤ kp(A)k}$$
where p is a polynomial and A a bounded linear operator (or matrix). Intersecting these sets over polynomials of degree 1 gives the closure of the numerical range, while intersecting over all polynomials gives the spectrum of A, with possible holes filled in.
Outside any set Vp(A) one can write the resolvent down explicitly and this leads to multicentric holomorphic functional calculus.
The spectrum, pseudospectrum or the polynomial numerical hulls can move rapidly in low rank perturbations. However, this happens in a very controlled way and when measured correctly one gets an identity which shows e.g. the following: if you have a low-rank homotopy between self-adjoint and quasinilpotent, then the identity forces the nonnormality to increase in exact compensation with the spectrum shrinking.
In this talk we shall mention how the multicentric calculus leads to a nontrivial extension of von Neumann theorem
$$kf(A)k ≤ sup |z|≤1
kf(z)k$$
where A is a contraction in a Hilbert space, and conclude with some new results on (nonholomorphic) functional calculus for operators for which p(A) is normal at a nontrivial polynomial p. Notice that this is always true for matrices.

"We consider certain distinguished extensions of the field F_p((t)) of formal Laurent series over F_p, and look at questions about their model theory and Galois theory, with a particular focus on decidability."

Viktor Mayer-Schönberger is Professor of Internet Governance and Regulation at the University of Oxford's Internet Institute. He is also a faculty affiliate of Harvard's Belfer Center for Science and International Affairs. Together with Kenneth Cukier he is the co-author of the international bestseller Big Data.

Dinits, Karzanov and Lomonosov showed that the minimal edge cuts of a finite graph have the structure of a cactus, a tree-like graph constructed from cycles. Evangelidou and Papasoglu extended this to minimal cuts separating the ends of an infinite graph. In this talk we will discuss a similar structure theorem for minimal vertex cuts separating the ends of a graph; these can be encoded by a succulent, a mild generalization of a cactus that is still tree-like.

Counterexamples to Vaught's Conjecture regarding the number of countable
models of a theory in a logical language, may felicitously be studied by investigating a tree
of types of different arities and belonging to different languages. This
tree emerges from a category of topological spaces, and may be studied as such, without
reference to the original logic. The tree has an intuitive character of absoluteness
and of self-similarity. We present theorems expressing these ideas, some old and some new.

Stallings' folding technique lets us factor a map of graphs as a sequence of "folds" (edge identifications) followed by an immersion. We will show how this technique gives an algorithm to express a free-group automorphism as the product of Whitehead automorphisms (and hence Nielsen transformations), as well as proving finite generation for some subgroups of the automorphism group of a free group.

http://hottformath.wikispaces.com

Note: joint with Algebra seminar.

String algebras are tame - their finite-dimensional representations have been classified - and the Auslander-Reiten quiver of such an algebra shows some of the morphisms between them.  But not all.  To see the morphisms which pass between components of the Auslander-Reiten quiver, and so obtain a more complete picture of the category of representations, we should look at certain infinite-dimensional representations and use ideas and techniques from the model theory of modules.

This is joint work with Rosie Laking and Gena Puninski:
G. Puninski and M. Prest,  Ringel's conjecture for domestic string algebras, arXiv:1407.7470;
R. Laking, M. Prest and G. Puninski, Krull-Gabriel dimension of domestic string algebras, in preparation.

String algebras are tame - their finite-dimensional representations have been classified - and the Auslander-Reiten quiver of such an algebra shows some of the morphisms between them.  But not all.  To see the morphisms which pass between components of the Auslander-Reiten quiver, and so obtain a more complete picture of the category of representations, we should look at certain infinite-dimensional representations and use ideas and techniques from the model theory of modules.

This is joint work with Rosie Laking and Gena Puninski:
G. Puninski and M. Prest,  Ringel's conjecture for domestic string algebras, arXiv:1407.7470;
R. Laking, M. Prest and G. Puninski, Krull-Gabriel dimension of domestic string algebras, in preparation.

Traditionally threshold partial pivoting is used to ensure stability of sparse LDL^T factorizations of symmetric matrices. This involves comparing a candidate pivot with all entries in its row/column to ensure that growth in the size of the factors is limited by a threshold at each stage of the factorization. It is capabale of delivering a scaled backwards error on the level of machine precision for practically all real world matrices. However it has significant flaws when used in a massively parallel setting, such as on a GPU or modern supercomputer. It requires all entries of the column to be up-to-date and requires an all-to-all communication for every column. The latter requirement can be performance limiting as the factorization cannot proceed faster than k*(communication latency), where k is the length of the longest path in the sparse elimination tree.

We introduce a new family of communication-avoiding pivoting techniques that reduce the number of messages required by a constant factor allowing the communication cost to be more effectively hidden by computation. We exhibit two members of this family. The first deliver equivalent stability to threshold partial pivoting, but is more pessimistic, leading to additional fill in the factors. The second provides similar fill levels as traditional techniques and, whilst demonstrably unstable for pathological cases, is able to deliver machine accuracy on even the worst real world examples.

More than twenty years ago Erdős conjectured that a triangle-free graph $G$ of chromatic number $k$ contains cycles of at least $k^{2−o(1)}$ different lengths. In this talk we prove this conjecture in a stronger form, showing that every such $G$ contains cycles of $ck^2\log k$ consecutive lengths, which is tight. Our approach can be also used to give new bounds on the number of different cycle lengths for other monotone classes of $k$-chromatic graphs, i.e.,  clique-free graphs and graphs without odd cycles.

Joint work with A. Kostochka and J. Verstraete.

The relationship of diagonal dominance ideas to the convergence of stationary iterations is well known. There are a multitude of situations in which such considerations can be used to guarantee convergence when the splitting matrix (the preconditioner) is positive definite. In this talk we will describe and prove sufficient conditions for convergence of a stationary iteration based on a splitting with an indefinite preconditioner. Simple examples covered by this theory coming from Optimization and Economics will be described.

This is joint work with Michael Ferris and Tom Rutherford

We will discuss the relation between perturbative gauge theory and
perturbative gravity, and look at how this relation extends to some exact
classical solutions. First, we will review the double copy prescription that
takes gauge theory amplitudes into gravity amplitudes, which has been
crucial to progress in perturbative studies of supergravity. Then, we will
see how the relation between the two theories can be made manifest when we
restrict to the self-dual sector, in four dimensions. A key role is played
by a kinematic algebraic structure mirroring the colour structure, which can
be extended from the self-dual sector to the full theory, in any number of
dimensions. Finally, we will see how these ideas can be applied also to some
exact classical solutions, namely black holes and plane waves. This leads to
a relation of the type Schwarzschild as (Coulomb charge)^2.

We consider the two-phase Stefan problem with p-degenerate diffusion, p larger than two, and we prove continuity up to the boundary for weak solutions, providing a modulus of continuity which we conjecture to be optimal. Since our results are proven in the form of a priori estimates for appropriate regularized problems, as corollary we infer the existence of a globally continuous weak solution for continuous Cauchy-Dirichlet datum.

Consider a nonsingular projective variety $X$ defined by a system of $R$ forms of the same degree $d$. The circle method proves the Hasse principle and Manin's conjecture for $X$ when $\text{dim}X > C(d,R)$. I will describe how to improve the value of $C$ when $R$ is large. I use a technique for estimating mean values of exponential sums which I call a ``moat lemma". This leads to a novel and intriguing system of auxiliary inequalities.

In the Erdös-Rényi random graph process, starting from an empty graph, in each step a new random edge is added to the evolving graph. One of its most interesting features is the `percolation phase transition': as the ratio of the number of edges to vertices increases past a certain critical density, the global structure changes radically, from only small components to a single giant component plus small ones.

In this talk we consider Achlioptas processes, which have become a key example for random graph processes with dependencies between the edges.

Starting from an empty graph these proceed as follows: in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. We discuss why, for a large class of rules, the percolation phase transition is qualitatively comparable to the classical Erdös-Rényi process.

Based on joint work with Oliver Riordan.

Given a 3-dimensional TQFT, the "conformal blocks" are the
values of that TQFT on closed Riemann surfaces.
The construction that we'll present (joint work with Douglas &
Bartels) takes as only input the value of the TQFT on discs. Towards
the end, I will explain to what extent the conformal blocks that we
construct agree with the conformal blocks constructed e.g. from the
theory of vertex operator algebras.