Past Events

In this talk, we examine some connections between graphs and matrix spaces (linear spaces of matrices). To begin, certain matrix spaces arise naturally from graphs, a construction that dates to

I recall some classical theorems from the analytic theory of polynomials, and then ask whether they can be "upgraded" from pointwise positivity to coefficientwise positivity. This leads to a series

I will discuss a probabilistic variant of the classic packing problem (with spheres, rods, squares, polyominoes, etc.), where the average density of the packing is controlled by a single “activity”

In the load-balancing problem, we have an $n$-vertex bipartite graph $G=(L, R, E)$ between a set of clients and servers. The goal is to find an assignment of all clients

We solve a long-standing open problem posed by Goodman and Pollack in 1988 by establishing a necessary and sufficient condition for a finite family of convex sets in $\mathbb{R}^d$ to

Permutations, words, set partitions, and other such families of objects often play a role in diverse subfields of mathematics, physics and computer science. When the structure of the object under

We study multi-buyer multi-item sequential item pricing mechanisms for revenue maximization with the goal of approximating a natural fractional relaxation -- the ex ante optimal revenue. We assume that buyers'

What can we understand about probability spaces on "nice" partitions of a geometric region? Can we design efficient samplers for geometric partitions of a region? Can we at least detect

Co-Investigators: Robin Dillon, Georgetown University, Nicholas Scurich, University of California, Irvine Officers at the United States Coast Guard (USCG) Search and Rescue (SAR) make a variety of high-stakes decisions under

The classical central limit theorem states that the average of an infinite sequence of independent and identically distributed random variables, when suitably rescaled, tends to a normal distribution. In fact,

Designing automated market makers (AMMs) for prediction markets on combinatorial securities over large outcome spaces presents significant computational challenges. Prior research has studied combinatorial prediction markets on specific set systems

The n-dimensional Boolean hypercube Q_n can be easily covered with 2 hyperplanes. If you add the additional restriction that exactly one point must remain uncovered, it takes some work to

In 2008, looking to bound the face vectors of tropical linear spaces, Speyer introduced the g-invariant of a matroid. He proved its coefficients nonnegative for matroids representable in characteristic zero

Adriano Garsia ( wiki ) started out in Harmonic Analysis, but soon enough saw the light and became one of the leaders of Enumerative and Algebraic Combinatorics. In this tribute,

The scale of modern machine learning models and data has made data selection a central problem. In this talk, we focus on the problem of finding the best representative subset

In this talk, I will first talk about 2-connected and 3-connected graphs and their constructions. Then, move on to the more general notion of k-blocks (of (k-1)-connected graphs) which can

Finding regular subgraphs can be useful. Many results assume a graph is regular or are easier to prove when they are. In 1975, Erdős and Sauer asked for an estimate,

Starting point of our talk will be a short discussion of the classical 15 puzzle. It turns out that similar problems about sliding numbered tiles around in a box are

We consider coresets for k-clustering problems, where the goal is to assign points to centers minimizing powers of distances. A popular example is the k-median objective. Given a point set

In this talk, I will go over some convex discrete geometry, specifically Radon's Theorem and some similar-ish statements. We will first use some linear algebra to prove the theorem(s) and