Past Events

TBA

The Oddtown problem is the perhaps the simplest application of the linear algebra method to extremal combinatorics. Motivated by the desire to better understand the method, we examine the generalization

At the 3rd Formal Power Series and Algebraic Combinatorics conference, that tool place in Bordeaux in 1991, Doron Zeilberger gave an invited talk with the title "Identities in Search of

When designing compound AI systems, a common approach is to query multiple copies of the same model and aggregate the responses to produce a synthesized output. Given the homogeneity of

A convex body is a bounded, centrally symmetric convex set with a nonempty interior. In the first part of the talk, we will briefly discuss some known results regarding these

In this talk, I’ll provide an overview of some advancements in AI and machine learning in proof assistant languages, such as Lean, Rocq, and Isabelle/HOL. I’ll discuss both neural and

We study the problem of selecting a representative committee of k agents from a collection of n agents in a common metric space. This problem is related to choosing k

I n classical auction design, we take it for granted that the auctioneer is trusted and always implements the auction's rules honestly. This assumption, however, no longer holds in modern

Around 1992, Aldous made the following bold conjecture. Let A be any set of transpositions in the symmetric group Sym(N). Then the spectral gap of the Cayley graph Cay(Sym(N),A) is

Okey is a Turkish tile-based game where players aim to empty their hand by forming sets of same numbered tiles, or runs of same colored tiles. I'll first showcase my

Folded Reed-Solomon (FRS) codes are a well-studied family of codes, known for achieving list decoding capacity. There has been a recent flurry of exciting results that have sharpened our combinatorial

For various examples of a graph H, an interesting question to ask is how big an H-intersecting family of graphs on n vertices can be, where H-intersecting means any two

We show that the shortest s-t path problem has the overlap-gap property in (i) sparse G(n,p) graphs and (ii) complete graphs with i.i.d. Exponential edge weights. Furthermore, we demonstrate that

We'll do a "show and tell" of what it's like to try to formalize some basic mathematics in Lean, with help from AI.

Combinatorial Geometry is a branch of math which, surprisingly, lies at the intersection of combinatorics and geometry. Who would have guessed. We'll talk about some classical extremal problems with points

MacMahon introduced a generalized notion of divisor sums that are easily interpreted in terms of integer partitions. In this talk, we take the audience on a tour that includes our

In online (sequential) calibration, a forecaster predicts probability distributions over a finite outcome space $[d]$ over a sequence of $T$ days, with the goal of being calibrated. While asymptotically calibrated

An Sk-set is a subset of a group whose k-tuples have distinct products. An Sk'-set is a subset of a group whose bipartite Cayley graph has no cycle of length

I introduce a heuristic principle I call "probabilistic continuation" and conjecture a striking asymptotic equivalence: the density of primes in a well-behaved integer sequence appears to match a structural ratio

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let f be a Boolean function where each output bit of f depends only on O(1) input