Past Events

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...

Random projections of high-dimensional probability measures have gained much attention in asymptotic convex geometry and high-dimensional statistics. While fluctuations at the level of the central limit theorem have been classically studied, only...

In this talk, we give a description of finite-dimensional commutative Frobenius algebras and we recall the description of 2-dimensional TQFTs. We show that these two structures are equivalent to each other.

I present recent advances in the design of models of hydrodynamic force and torque exerted on monodisperse spheres in a statistically homogeneous random array at Reynolds number 0.01 ≤ Re ≤ 150 and solid volume fraction 0.02 ≤ φ ≤ 40. All models take...

Functions of microorganisms like looking for nutrition and biological processes such as infection and reproduction are possible due to microfluidic motion. Developments over the past two decades in tracking and manipulation at the microfluidic level...

Let K/k be a finite Galois extension. We define a principal version of the Chebotarev density theorem which represents the density of prime ideals of k that factor into a product of principal prime ideals in K. We find explicit equations to express...

An interesting question in spectral graph theory is about the structure of the eigenvectors of matrices associated with graphs. A graph is weakly Hadamard diagonalizable (WHD) if its Laplacian matrix L can be diagonalized with a weakly Hadamard...