Past Events

In the preface of its Lectures on Noncommutative Geometry [Gin05], Ginzburg writes: “Each of the mathematical worlds that we study is governed by an appropriate operad. Commutative geometry is governed by the operad of commutative (associative)...

From the work on Bernoulli convolutions by P. Erd\H{o}s in 1939 and up to the recent advances on self-similar measures by M. Hochman, P. Shmerkin, P. Varj\'u, and others, questions on absolute continuity and singularity remain to be a challenge. They...

In this talk, we will study the mean field limit of weakly interacting diffusions for confining and interaction potentials that are not necessarily convex. We explore the relationship between the large N limit of the constant in the logarithmic...

In his seminal work on modular curves and the Eisenstein ideal, Mazur studied the existence of congruences between certain Eisenstein series and newforms, proving that Eisenstein ideals associated to weight 2 cusp forms of prime level are locally...

It is well known that a maximal planar graph of order at least 3 is 3-colourable if and only if it is Eulerian. It is also known that if a maximal planar graph of order at least 3 has exactly two vertices of odd degree, then these vertices are...

There is a wealth of combinatorial algorithms for classical min-cost flow problems and their simpler variants like max flow or shortest-path problems. It is wellknown that several of these algorithms are intimately related to the Simplex method and...

The Zener cards are a deck of nm cards where each of n symbols is depicted on exactly m cards. The following experiment \((n=mu=5)\)has been used since the early ‘30s to test for extrasensory perceptions: the alleged telepath tries to guess cards one...

I will describe a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel-Walfisz theorem, Hoheisel's asymptotic for short intervals, a Brun-Titchmarsh bound and Linnik's bound for the least prime...

In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs of polygons. We show how to...

A “quasisymmetric variety” (QSV) is a subset of permutations that (when considered as points in n-space) have a vanishing ideal that shares key properties with the ideal generated by quasisymmetric polynomials, and moreover which forms a basis for...