Past Events

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

Decompositions of combinatorial structures translate very often to functional equations with positive coefficients for their generating functions. A theorem by Bender says that if the generating function is univariate and the equation not linear, the...

Products of permutations are used to model problems in fields ranging from representation theory and algebraic geometry to topological graph theory. I will show how probability can be used to study such problems, with a focus on how graphs may be...

I will describe a new approach for exhaustively generating combinatorial objects by combining a satisfiability (SAT) solver with an isomorph-free exhaustive generation method such as orderly generation. The SAT solver is able to limit the search to...