Past Events

Abstract: Recent advances in experimental methodologies and large-scale community efforts have led to an explosion of single-cell genomics and imaging data, creating a need for new analytical frameworks capable of extracting meaningful structure and...

Given a complex Lie group G of adjoint type, the wonderful compactification Y(G) (originally described by work of DeConcini-Procesi) is a compactification of G by a divisor with simple normal crossings. These groups are specified by their Dynkin...

In this talk we will address the relatively new objects quaternary Legendre pairs. These objects (and their binary counterparts) were introduced in order to construct Hadamard matrices and have garnered renewed interest recently. Over the course of...

Falconer-type problems seek Hausdorff-dimension thresholds guaranteeing that thin subsets of R d contain rich geometric patterns. For a compact set E ⊂ R d , the classical object is the distance set ∆(E) = { |x − y| : x, y ∈ E }, and its pinned...

Neurons are often viewed as the fundamental units of computation, yet they are also living cells that must sustain this computation within the physical and metabolic limits of biology. In this talk, I present a quantitative framework for...

Drinfeld modules are the analogues of elliptic curves in positive characteristic. They are essential objects in number theory for studying function fields. They do not have points, in the traditional sense�we're going to count them anyway! The first...

As an academic mathematician with a few decades of experience working with industry, the speaker has encountered many challenging problems that required the knowledge and development of a diverse collection of mathematical tools to effectively meet...

The analysis of why a specific MIP instance is infeasible formally can be reduced to computing an Irreducible Infeasible Subset (IIS) of the constraints. Unlike the case of LP, for MIP there is no useful duality that can be employed to facilitate...

Cooperative motion is a random walk process where the jump rate of a particle depends on the likelihood that another independent identical walker is at the same position. It was studied on the line in a paper by Addario-Berry, Cairns, Devroye...

Given a compact set E ⊂ R^d , its distance set is ∆(E) = { |x − y| : x, y ∈ E }, and for y ∈ E, the pinned distance set of E at y is ∆ y (E) = { |x − y| : x ∈ E }. A classical result of Mattila and Sjölin shows that the unpinned distance set ∆(E) has...