15:00
The Circle Problem
Abstract
Let N(A) be the number of integer solutions of x^2 + y^2
Let N(A) be the number of integer solutions of x^2 + y^2
We present algorithms for dense LU and QR factorizations that minimize the cost of communication. One of today's challenging technology trends is the increased communication cost. This trend predicts that arithmetic will continue to improve exponentially faster than bandwidth, and bandwidth exponentially faster than latency. The new algorithms for dense QR and LU factorizations greatly reduce the amount of time spent communicating, relative to conventional algorithms.
This is joint work with James Demmel, Mark Hoemmen, Julien Langou, and Hua Xiang.
In this talk I will introduce hyperbolic 3-manifolds, state some major conjectures about them, and discuss some group-theoretic properties of their fundamental groups.
I will discuss ongoing work to provide a proof for the following
conjecture: if the development of a time symmetric, conformally flat
initial data set admits a smooth null infinity, then the initial data
is Schwarzschildean in a neighbourhood of infinity. The strategy
to construct a proof consists in a detailed analysis of a
certain type of expansions that can be obtained using H. Friedrich's
"cylinder at infinity" formalism. I will also discuss a toy model for
the analysis of the Maxwell field near the
spatial infinity of the Schwarzschild spacetime
It is an interesting exercise to compute the iterated integrals of Brownian Motion and to calculate the expectations (of polynomial functions of these integrals).
Recent work on constructing discrete measures on path space, which give the same value as Wiener measure to certain of these expectations, has led to promising new numerical algorithms for solving 2nd order parabolic PDEs in moderate dimensions. Old work of Krylov associated finitely additive signed measures to certain constant coefficient PDEs of higher order. Recent work with Levin allows us to identify the relevant expectations of iterated integrals in this case, leaving many interesting open questions and possible numerical algorithms for solving high dimensional elliptic PDEs.
APOLOGIES - this seminar is cancelled.
Professor Terry Lyons will talk instead on signed probability measures and some old results of Krylov.
Log-Sobolev inequalities with weighted square field are derived from a class of super Poincaré inequalities. As applications, stronger versions of Talagrand's transportation-cost inequality are provided on Riemannian manifolds. Typical examples are constructed to illustrate these results.
I will describe how atom interferometry can be used to set limits on beyond the Standard Model forces.
A new primal-dual augmented Lagrangian merit function is proposed that may be minimized with respect to both the primal and dual variables. A benefit of this approach is that each subproblem may be regularized by imposing explicit bounds on the dual variables. Two primal-dual variants of classical primal methods are given: a primal-dual bound constrained Lagrangian (pdBCL) method and a primal-dual l1 linearly constrained Lagrangian (pdl1-LCL) method.
This talk will be about the systematic simplification of differential equations.
After giving a geometric reformulation of the concept of a differential equation using prolongations, I will show how we can prolong group actions relatively easily at the level of Lie algebras. I will then discuss group-invariant solutions.
The key example will be the heat equation.
We discuss the convergence in distribution of rescaled random planar maps viewed as random metric spaces. More precisely, we consider a random planar map M(n), which is uniformly distributed over the set of all planar maps with n faces in a certain class. We equip the set of vertices of M(n) with the graph distance rescaled by the factor n to the power 1/4. We then discuss the convergence in distribution of the resulting random metric spaces as n tends to infinity, in the sense of the Gromov-Hausdorff distance between compact metric spaces. This problem was stated by Oded Schramm in his plenary address paper at the 2006 ICM, in the special case of triangulations.
In the case of bipartite planar maps, we first establish a compactness result showing that a limit exists along a suitable subsequence. Furthermore this limit can be written as a quotient space of the Continuum Random Tree (CRT) for an equivalence relation which has a simple definition in terms of Brownian labels attached to the vertices of the CRT. Finally we show that any possible limiting metric space is almost surely homomorphic to the 2-sphere. As a key tool, we use bijections between planar maps and various classes of labelled trees.
We study the dynamic of a very simple chain of three anharmonic oscillators with linear nearest-neighbour couplings. The first and the last oscillator furthermore interact with heat baths through friction and noise terms. If all oscillators in such a system are coupled to heat baths, it is well-known that under relatively weak coercivity assumptions, the system has a spectral gap (even compact resolvent) and returns to equilibrium exponentially fast. It turns out that while it is still possible to show the existence and uniqueness of an invariant measure for our system, it returns to equilibrium much slower than one would at first expect. In particular, it no longer has compact resolvent when the potential of the oscillators is quartic and the spectral gap is destroyed when it grows even faster.