Past Forthcoming Seminars

18 October 2017
16:00
Abstract

I will present a gentle introduction to the theory of conformal dimension, focusing on its applications to the boundaries of hyperbolic groups, and the difficulty of classifying groups whose boundaries have conformal dimension 1.

  • Junior Topology and Group Theory Seminar
17 October 2017
16:00
Itaï Ben Yaacov
Abstract

Globally Valued Fields, studied jointly with E. Hrushovski, are a formalism for fields in which the sum formula for valuations holds, such as number fields or function fields of curves. They form an elementary class (in continuous first order logic), and model-theoretic questions regarding this class give rise to difficult yet fascinating geometric questions.
I intend to present « Lyon school » approach to studying GVFs. This consists of reducing as much as possible to local considerations, among other things via the "fullness" axiom.
 

17 October 2017
15:45
Thomas Prince
Abstract

Given a Fano manifold we will consider two ways of attaching a (usually infinite) collection of polytopes, and a certain combinatorial transformation relating them, to it. The first is via Mirror Symmetry, following a proposal of  Coates--Corti--Kasprzyk--Galkin--Golyshev. The second is via symplectic topology, and comes from considering degenerating Lagrangian torus fibrations. We then relate these two collections using the Gross--Siebert program. I will also comment on the situation in higher dimensions, noting particularly that by 'inverting' the second method (degenerating Lagrangian fibrations) we can produce topological constructions of Fano threefolds.
 

  • Algebraic Geometry Seminar
17 October 2017
14:30
Matteo Croci
Abstract

In this talk we describe a new approach that enables the use of elliptic PDEs with white noise forcing to sample Matérn fields within the multilevel Monte Carlo (MLMC) framework.

When MLMC is used to quantify the uncertainty in the solution of PDEs with random coefficients, two key ingredients are needed: 1) a sampling technique for the coefficients that satisfies the MLMC telescopic sum and 2) a numerical solver for the forward PDE problem.

When the dimensionality of the uncertainty in the problem is infinite (i.e. coefficients are random fields), the sampling techniques commonly used in the literature are Karhunen–Loève expansions or circulant embeddings. In the specific case in which the coefficients are Gaussian fields of Mat ́ern covariance structure another sampling technique available relies on the solution of a linear elliptic PDE with white noise forcing.


When the finite element method (FEM) is used for the forward problem, the latter option can become advantageous as elliptic PDEs can be quickly and efficiently solved with the FEM, the sampling can be performed in parallel and the same FEM software can be used without the need for external packages. However, it is unclear how to enforce a good stochastic coupling of white noise between MLMC levels so as to respect the MLMC telescopic sum. In this talk we show how this coupling can be enforced in theory and in practice.

  • Numerical Analysis Group Internal Seminar
17 October 2017
14:30
Michelle Delcourt
Abstract

Enumerating families of combinatorial objects with given properties and describing the typical structure of these objects are fundamental problems in extremal combinatorics. In this talk, we will investigate intersecting families of discrete structures in various settings, determining their typical structure as the size of the underlying ground set tends to infinity. Our new approach outlines a general framework for a number of similar problems; in particular, we prove analogous results for hypergraphs, permutations, and vector spaces using the same technique. This is joint work with József Balogh, Shagnik Das, Hong Liu, and Maryam Sharifzadeh.

  • Combinatorial Theory Seminar
17 October 2017
14:15
Aslak Buan
Abstract

We give a short reminder about central results of classical tilting theory, 
including the Brenner-Butler tilting theorem, and
homological properties of tilted and quasi-tilted algebras. We then discuss 
2-term silting complexes and endomorphism algebras of such objects,
and in particular show that some of these classical results have very natural 
generalizations in this setting.
(joint work with Yu Zhou)

17 October 2017
14:00
Abdul-Lateef Haji-Ali
Abstract

We propose and analyze a multilevel weighted least squares polynomial approximation method. Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method, which employs samples with different accuracies and is able to match the accuracy of single level approximations at reduced computational work. We prove complexity bounds under certain assumptions on polynomial approximability and sample work. Furthermore, we propose an adaptive
algorithm for situations where such assumptions cannot be verified a priori. Numerical experiments underline the practical applicability of our method.

  • Numerical Analysis Group Internal Seminar

Pages