Past

The idea of A-free group, where A is a discrete ordered abelian group, has been introduced by Myasnikov, Remeslennikov and Serbin. It generalises the construction of free groups. A proof will be outlined that a group is A-free for some A if and only if it acts freely and without inversions on a \lambda-tree, where \lambda is an arbitrary ordered abelian group.

Vector bundles over a compact manifold can be defined via transition 
functions to a linear group. Often one imposes 
conditions on this structure group. For example for real vector bundles on 
may  ask that all 
transition functions lie in the special orthogonal group to encode 
orientability. Commutative K-theory arises when we impose the condition 
that the transition functions commute with each other whenever they are 
simultaneously defined.

We will introduce commutative K-theory and some natural variants of it, 
and will show that they give rise to  new generalised 
cohomology theories.

This is joint work with Adem, Gomez and Lind building on previous work by 
Adem, F. Cohen, and Gomez.

The Taylor expansion of a controlled differential equation suggests that the solution at time 1 depends on the driving path only through the latter's iterated integrals up to time 1, if the vector field is infinitely differentiable. Hambly and Lyons proved that this remains true for Lipschitz vector fields if the driving path has bounded total variation. We extend the Hambly-Lyons result for weakly geometric rough paths in finite dimension. Joint work with X. Geng, T. Lyons and D. Yang.    

Mathematical imaging is not only a multidisciplinary research area but also a major cross-discipline subject within mathematical sciences as  image analysis techniques involve differential geometry, optimization, nonlinear partial differential equations (PDEs), mathematical analysis, computational algorithms and numerical analysis. Segmentation refers to the essential problem in imaging and vision  of automatically detecting objects in an image.

In this talk I first review some various models and techniques in the variational framework that are used for segmentation of images, with the purpose of discussing the state of arts rather than giving a comprehensive survey. Then I introduce the practically demanding task of detecting local features in a large image and our recent segmentation methods using energy minimization and  PDEs. To ensure uniqueness and fast solution, we reformulate one non-convex functional as a convex one and further consider how to adapt the additive operator splitting method for subsequent solution. Finally I show our preliminary work to attempt segmentation of blurred images in the framework of joint deblurring and segmentation.

This talk covers joint work with Jianping Zhang, Lavdie Rada, Bryan Williams, Jack Spencer (Liverpool, UK), N. Badshah and H. Ali (Pakistan). Other collaborators in imaging in general include T. F. Chan, R. H. Chan, B. Yu,  L. Sun, F. L. Yang (China), C. Brito (Mexico), N. Chumchob (Thailand),  M. Hintermuller (Germany), Y. Q. Dong (Denmark), X. C. Tai (Norway) etc. [Related publications from   http://www.liv.ac.uk/~cmchenke ]

Mathematical imaging is not only a multidisciplinary research area but also a major cross-discipline subject within mathematical sciences as  image analysis techniques involve differential geometry, optimization, nonlinear partial differential equations (PDEs), mathematical analysis, computational algorithms and numerical analysis. Segmentation refers to the essential problem in imaging and vision  of automatically detecting objects in an image.

In this talk I first review some various models and techniques in the variational framework that are used for segmentation of images, with the purpose of discussing the state of arts rather than giving a comprehensive survey. Then I introduce the practically demanding task of detecting local features in a large image and our recent segmentation methods using energy minimization and  PDEs. To ensure uniqueness and fast solution, we reformulate one non-convex functional as a convex one and further consider how to adapt the additive operator splitting method for subsequent solution. Finally I show our preliminary work to attempt segmentation of blurred images in the framework of joint deblurring and segmentation.

This talk covers joint work with Jianping Zhang, Lavdie Rada, Bryan Williams, Jack Spencer (Liverpool, UK), N. Badshah and H. Ali (Pakistan). Other collaborators in imaging in general include T. F. Chan, R. H. Chan, B. Yu,  L. Sun, F. L. Yang (China), C. Brito (Mexico), N. Chumchob (Thailand),  M. Hintermuller (Germany), Y. Q. Dong (Denmark), X. C. Tai (Norway) etc.

[Related publications from   http://www.liv.ac.uk/~cmchenke ]

The aim of this two-day workshop is to bring together mathematicians, biologists and researchers from other disciplines whose work involves stochastic and multiscale phenomenon, to identify common methodologies to studying such systems, both from a numerical and analytical perspective.   Relevant topics include asymptotic methods for PDEs; multiscale analysis of stochastic dynamical systems; mean-field limits of collective dynamics.  Numerical methods, mathematical theory and applications (with a specific focus on biology) will all be discussed.  The workshop will take place on the 1st and 2nd of September, at the Mathematical Institute, Oxford University.   Please visithttps://sites.google.com/site/stochmultiscale2014/ for more information and to register.

The aim of this two-day workshop is to bring together mathematicians, biologists and researchers from other disciplines whose work involves stochastic and multiscale phenomenon, to identify common methodologies to studying such systems, both from a numerical and analytical perspective.   Relevant topics include asymptotic methods for PDEs; multiscale analysis of stochastic dynamical systems; mean-field limits of collective dynamics.  Numerical methods, mathematical theory and applications (with a specific focus on biology) will all be discussed.  The workshop will take place on the 1st and 2nd of September, at the Mathematical Institute, Oxford University.   Please visithttps://sites.google.com/site/stochmultiscale2014/ for more information and to register.

Economic dispatch is a critical part of electricity planning and 
operation. Enhancing the dispatch problem to improve its robustness 
in the face of equipment failures or other contingencies is standard 
practice, but extremely time intensive, leading to restrictions on 
the richness of scenarios considered. We model post-contingency 
corrective actions in the security-constrained economic dispatch 
and consider multiple stages of rescheduling to meet different 
security constraints. The resulting linear program is not solvable
by traditional LP methods due to its large size. We devise and 
implement a series of algorithmic enhancements based on the Benders'
decomposition method to ameliorate the computational difficulty.
In addition, we propose a set of online measures to diagnose
and correct infeasibility issues encountered in the solution process.

The overall solution approach is able to process the ``N-1'' 
contingency list in ten minutes for all large network cases
available for experiments. Extensions to the nonlinear setting will 
be discussed via a semidefinite relaxation.

July 5

9:30-10:30

Robert Langlands (IAS, Princeton)

Problems in the theory of automorphic forms: 45 years later 

11:00-12:00

Christopher Deninger (Univ. Münster)

Zeta functions and foliations     

 13:30-14:30          

Christophe Soulé (IHES, Bures-sur-Yvette)

 A singular arithmetic Riemann-Roch theorem           

14:40-15:40

Minhyong Kim (Univ. Oxford)

 Non-abelian reciprocity laws and Diophantine geometry

 16:10-17:10  

Constantin Teleman (Berkeley/Oxford)           

Categorical representations and Langlands duality 

July 6

 9:30-10:30

Ted Chinburg (Univ. Pennsylvania, Philadelphia)

 Higher Chern classes in Iwasawa theory

11:00-12:00          

Yuri Tschinkel (Courant Institute, New York)

Introduction to almost abelian anabelian geometry

13:30-14:30

Ralf Meyer (Univ. Göttingen)

Groupoids and higher groupoids

14:40-15:40

Dennis Gaitsgory (Harvard Univ., Boston)

Picard-Lefschetz oscillators for Drinfeld-Lafforgue compactifications

16:10-17:10

François Loeser (Univ. Paris 6-7)

Motivic integration and representation theory

July 7

9:00-10:00

Matthew Morrow (Univ. Bonn)                                                  

On the deformation theory of algebraic cycles

10:30-11:30

Fedor Bogomolov (Courant Institute, New York/Univ. Nottingham)

On the section conjecture in anabelian geometry                 

13:15-14:15                                                                      

Kevin Buzzard (ICL, London)

p-adic Langlands correspondences

14:45-15:45                                                                      

Masatoshi Suzuki (Tokyo Institute of Technology)

Translation invariant subspaces and GRH for zeta functions

16:00-17:00

Edward Frenkel (Univ. California Berkeley)

"Love and Math", the Langlands programme - Public presentation

July 8

9:15-10:15

Mikhail Kapranov (Kavli IMPU, Tokyo)

Lie algebras and E_n-algebras associated to secondary polytopes                                 

10:45-11:45          

Sergey Oblezin (Univ. Nottingham)

Whittaker functions, mirror symmetry and the Langlands correspondence

13:30-14:30                                                                      

Edward Frenkel (Univ. California Berkeley)

The Langlands programme and quantum dualities

14:40-15:40                                                                                              

Dominic Joyce (Univ. Oxford)

Derived symplectic geometry and categorification

16:10-17:10  

Urs Schreiber (Univ. Nijmegen, The Netherlands)

Correspondences of cohesive linear homotopy types and quantization

Universal fluctuations are shown to exist when well-known and widely used numerical algorithms are applied with random data. Similar universal behavior is shown in stochastic algorithms and algorithms that model neural computation. The question of whether universality is present in all, or nearly all, computation is raised. (Joint work with G.Menon, S.Olver and T. Trogdon.)

Seismology currently undergoes rapid and exciting advances fueled by a simultaneous surge in recorded data (in both quality and quantity), realistic wave-propagation algorithms, and supercomputing capabilities. This enables us to sample parameter spaces of relevance for imaging the Earth's interior 3D structure with fully numerical techniques. Seismic imaging is the prime approach to illuminate and understand global processes such as mantle convection, plate tectonics, geodynamo, the vigorous interior of the Sun, and delivers crucial constraints on our grasp of volcanism, the carbon cycle and seismicity. At local scales, seismic Earth models are inevitable for hydrocarbon exploration, monitoring of flow processes, and natural hazard assessment.

\\

\\

With a slight focus on global-scale applications, I will present the underlying physical model of realistic wave propagation, its numerical discretization and link such forward modeling to updating Earth models by means of inverse modeling. The associated computational burden to solve high-resolution statistical inverse problems with precise numerical techniques is however entirely out of reach for decades to come. Consequently, seismologists need to take approximations in resolution, physics, data and/or inverse methodology. I will scan a number of such end-member approximations, and focus on our own approach to simultaneously treat wave physics realistically across the frequency band while maximizing data usage and allow for uncertainty quantification. This approach is motivated by decisive approximations on the model space for typical Earth structures and linearized inverse theory.

Peter Grindrod and Stephen Haben (UoOx)

We show how to reduce the general formulation of the mass-angular momentum inequality, for axisymmetric initial data of the Einstein equations, to the known maximal case whenever a geometrically motivated system of equations admits a solution. This procedure is based on a certain deformation of the initial data which preserves the relevant geometry, while achieving the maximal condition and its implied inequality (in a weak sense) for the scalar curvature; this answers a question posed by R. Schoen. The primary equation involved, bears a strong resemblance to the Jang-type equations studied in the context of the positive mass theorem and the Penrose inequality. Each equation in the system is analyzed in detail individually, and it is shown that appropriate existence/uniqueness results hold with the solution satisfying desired asymptotics. Lastly, it is shown that the same reduction argument applies to the basic inequality yielding a lower bound for the area of black holes in terms of mass and angular momentum.

This is joint work with Angus Macintyre.

We prove that the first-order theory of a finite extension of the field of p-adic numbers is model-complete in the language of rings, for any prime p.

To prove this we prove universal definability of the valuation rings of such fields using work of Cluckers-Derakhshan-Leenknegt-Macintyre on existential

definability, quantifier elimination of Basarab-Kuhlmann for valued fields in a many-sorted language involving higher residue rings and groups,

a model completeness theorem for certain pre-ordered abelian groups which generalize Presburger arithmetic (we call finite-by-Presburger groups),

and an interpretation of higher residue rings of such fields in the higher residue groups.

Lie algebroids are geometric structures that interpolate between finite-dimensional Lie algebras and tangent bundles of manifolds. They give a useful language for describing geometric situations that have local symmetries. I will give an introduction to the basic theory of Lie algebroids, with examples drawn from foliations, principal bundles, group actions, Poisson brackets, and singular hypersurfaces.

This is a joint work with V. Lemaire

(LPMA-UPMC). We propose and analyze a Multilevel Richardson-Romberg

(MLRR) estimator which combines the higher order bias cancellation of

the Multistep Richardson-Romberg ($MSRR$) method introduced

in~[Pag\`es 07] and the variance control resulting from the

stratification in the Multilevel Monte Carlo (MLMC) method (see~$e.g.$

[Heinrich 01, M. Giles 08]). Thus we show that in standard frameworks

like discretization schemes of diffusion processes, an assigned

quadratic error $\varepsilon$ can be obtained with our (MLRR)

estimator with a global complexity of

$\log(1/\varepsilon)/\varepsilon^2$ instead of

$(\log(1/\varepsilon))^2/\varepsilon^2$ with the standard (MLMC)

method, at least when the weak error $\E Y_h-\EY_0}$ induced by the

biased implemented estimator $Y_h$ can be expanded at any order in

$h$. We analyze and compare these estimators on several numerical

problems: option pricing (vanilla or exotic) using $MC$ simulation and

the less classical Nested Monte Carlo simulation (see~[Gordy \& Juneja

2010]).

We are interested in large systems of agents collectively looking for a

consensus (about e.g. their direction of motion, like in bird flocks). In

spite of the local character of the interactions (only a few neighbours are

involved), these systems often exhibit large scale coordinated structures.

The understanding of how this self-organization emerges at the large scale

is still poorly understood and offer fascinating challenges to the modelling

science. We will discuss a few of these issues on a selection of specific

examples.

The accurate and efficient solution of linear systems Ax = b is very important in many engineering and technological applications, and systems of this form also arise as subproblems within other algorithms. In particular, this is true for interior point methods (IPM), where the Newton system must be solved to find the search direction at each iteration. Solving this system is a computational bottleneck of an IPM, and in this talk I will explain how preconditioning and deflation techniques can be used, to lessen this computational burden.

This is joint work with Jacek Gondzio.

I shall outline a general method for finding upper bounds on the diameters of finite groups, based on the Solovay-Kitaev procedure from quantum computation. This method may be fruitfully applied to groups arising as quotients of many familiar pro-p groups. Time permitting, I will indicate a connection with weak spectral gap, and give some applications.

Waldhausen defined higher K-groups for categories with certain extra structure. In this talk I will define categories with cofibrations and weak equivalences, outline Waldhausen's construction of the associated K-Theory space, mention a few important theorems and give some examples. If time permits I will discuss the infinite loop space structure on the K-Theory space.

 A continuum is a non-empty compact connected metric space. Given a continuum X let P(X) be the power set of X. We define the following set functions:
T:P(X) to P(X) given by, for each A in P(X), T(A) = X \ { x in X : there is a continuum W such that x is in Int(W) and W does not intersect A}
K:P(X) to P(X) given by, for each A in P(X), K(A) = Intersection{ W : W is a subcontinuum of X and A is in the interior of W}
S:P(X) to P(X) given by, for each A in P(X), S(A) = { x in T(A) : A intersects T(x)}
Some properties and relations between these functions are going to be presented.

A word w has finite width n in a group G if each element in the subgroup generated by the w-values in G can be written as the product of at most n w-values. A group G is called verbally elliptic if every word has finite width in G. In this talk I will present a proof for the fact that every finitely generated virtually nilpotent group is verbally elliptic.

The Springer Correspondence relates irreducible representations of the Weyl group of a semisimple complex Lie algebra to the geometry of the cone of nilpotent elements of the Lie algebra. The zeroth Poisson homology of a variety is the quotient of all functions by those spanned by Poisson brackets of functions. I will explain a conjecture with Proudfoot, based on a conjecture of Lusztig, that assigns a grading to the irreducible representations of the Weyl group via the Poisson homology of the nilpotent cone. This conjecture is a kind of symplectic duality between this nilpotent cone and that of the Langlands dual. An analogous statement for hypertoric varieties is a theorem, which relates a hypertoric variety with its Gale dual, and assigns a second grading to its de Rham cohomology, which turns out to coincide with a different grading of Denham using the combinatorial Laplacian.

The goal of this second talk is to study the existence of global jet differentials. Thanks to the algebraic Morse inequalities, the problem reduces to the computation of a certain Chern number on the Demailly tower of projectivized jet bundles. We will describe the significant simplification due to Berczi consisting in integrating along the fibers of this tower by mean of an iterated residue formula. Beside the original argument coming from equivariant geometry, we will explain our alternative proof of such a formula and we will particularly be interested in the interplay between the two approaches.

We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between quadrangulations and maps, to define a growth procedure for maps. The growth procedure is local, in that every map is obtained from its predecessor by an operation that only modifies vertices lying on a common face with some fixed vertex. The sequence of maps has an almost sure limit G; we show that G is the distributional local limit of large, uniformly random 3-connected graphs.
A classical result of Brooks, Smith, Stone and Tutte associates squarings of rectangles to edge-rooted planar graphs. Our map growth procedure induces a growing sequence of squarings, which we show has an almost sure limit: an infinite squaring of a finite rectangle, which almost surely has a unique point of accumulation. We know almost nothing about the limit, but it should be in some way related to "Liouville quantum gravity".
Parts joint with Nicholas Leavitt.

We present our recent results  on the fluctuation of Optimal Alignments of random sequences and Longest Common Subsequences (LCS). We show how OA and LCS are special cases of certain Last Passage Percolation models which can also be viewed as growth models. this is joint work with Saba Amsalu, Raphael Hauser and Ionel Popescu.

Hyperbolicity is the study of the geometry of holomorphic entire curves $f:\mathbb{C}\to X$, with values in a given complex manifold $X$. In this introductary first talk, we will give some definitions and provide historical examples motivating the study of the hyperbolicity of complements $\mathbb{P}^{n}\setminus X_{d}$ of projective hypersurfaces $X_{d}$ having sufficiently high degree $d\gg n$.

Then, we will introduce the formalism of jets, that can be viewed as a coordinate free description of the differential equations that entire curves may satisfy, and explain a successful general strategy due to Bloch, Demailly, Siu, that relies in an essential way on the relation between entire curves and jet differentials vanishing on an ample divisor.

Incomplete Cholesky (IC) factorizations have long been an important tool in the armoury of methods for the numerical solution of large sparse symmetric linear systems Ax = b. In this talk, I will explain the use of intermediate memory (memory used in the construction of the incomplete factorization but is subsequently discarded)  and show how it can significantly improve the performance of the resulting IC preconditioner. I will then focus on extending the approach to sparse symmetric indefinite systems in saddle-point form. A limited-memory signed IC factorization of the form LDLT is proposed, where the diagonal matrix D has entries +/-1. The main advantage of this approach is its simplicity as it avoids the use of numerical pivoting.  Instead, a global shift strategy is used to prevent breakdown and to improve performance. Numerical results illustrate the effectiveness of the signed incomplete Cholesky factorization as a preconditioner.

Networks provide a convenient way to represent complex systems of interacting entities. Many networks contain "communities" of nodes that are more strongly connected to each other than to nodes in the rest of the network. Most methods for detecting communities are designed for static networks. However, in many applications, entities and/or interactions between entities evolve in time. To incorporate temporal variation into the detection of a network's community structure, two main approaches have been adopted. The first approach entails aggregating different snapshots of a network over time to form a static network and then using static techniques on the resulting network. The second approach entails using static techniques on a sequence of snapshots or aggregations over time, and then tracking the temporal evolution of communities across the sequence in some ad hoc manner. We represent a temporal network as a multilayer network (a sequence of coupled snapshots), and discuss  a method that can find communities that extend across time. 

We investigate the dynamics of a class of tumor growth

models known as mixed models. The key characteristic of these type of

tumor growth models is that the different populations of cells are

continuously present everywhere in the tumor at all times. In this

work we focus on the evolution of tumor growth in the presence of

proliferating, quiescent and dead cells as well as a nutrient.

The system is given by a multi-phase flow model and the tumor is

described as a growing continuum such that both the domain occupied by the tumor as well as its boundary evolve in time. Global-in-time weak solutions

are obtained using an approach based on penalization of the boundary

behavior, diffusion and viscosity in the weak formulation.

Further extensions will be discussed.

This is joint work with D. Donatelli.

Since their introduction, Shimura varieties have proven to be important landmarks sitting right at the crossroads between algebraic geometry, number theory and representation theory. In this talk, starting from the yoga of motives and Hodge theory, we will try to motivate Deligne's construction of Shimura varieties, and briefly survey some of their zoology and basic properties. I may also say something about the links to automorphic forms, or their integral canonical models.

We consider the numerical approximation of Kolmogorov equations arising in the context of option pricing under L\'evy models and beyond in a multivariate setting. The existence and uniqueness of variational solutions of the partial integro-differential equations (PIDEs) is established in Sobolev spaces of fractional or variable order.

Most discretization methods for the considered multivariate models suffer from the curse of dimension which impedes an efficient solution of the arising systems. We tackle this problem by the use of sparse discretization methods such as classical sparse grids or tensor train techniques. Numerical examples in multiple space dimensions confirm the efficiency of the described methods.

In this talk I will discuss a deformation principle for cohomology with coefficients in representations on Banach spaces. The

main idea is that small, metric perturbations of representations do not change the vanishing of cohomology in degree n, provided that

we have additional information about the cohomology in degree n+1. The perturbations considered here happen only on the generators of a

group and even for isometric representations give rise to unbounded representations. Applications include fixed point properties for

affine actions and strengthening of Kazhdan’s property (T). This is joint work with Uri Bader.