Past Events

Given a rooted tree on n leaves, we define the natural “split-away” property for a triplet of leaves (u,v,w): w splits away from (u,v) if the lowest common ancestor (LCA)

We address the problem of finding sets of integers of a given size with a maximum number of pairs summing to powers of 2. By fixing particular pairs, this problem

Rising provider turnover results in frequency needing to rematch patients with available providers. However, the rematching process is cumbersome for both patients and health systems, resulting in labor-intensive and ad

Navigability captures the ability of a complex network to support efficient, decentralized search. The concept has a rich history, from Milgram’s "six degrees of separation" to Kleinberg’s computational model of

We will talk about ... longest cycles in 2-connected graphs. When the longest cycle length is the number of vertices, longest cycles are Hamilton cycles. We will proceed chronologically with

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair touches. In this talk, we discuss the techniques behind

In the March 2025 issue of Pour La Science (the French analog of Scientific American), Jean-Paul Delahaye, (the French (and contemporary) analog of Martin Gardner), solved (in collaboration with his

In the Max-Cut problem in the streaming model, an algorithm is given the edges of an unknown graph G = (V, E) in some fixed order, and its goal is

We introduce an LLM + computer software framework for proving sophisticated inequalities in research mathematics. We first ask a frontier LLM to break up a problem into its simplest parts,

A graph G is called H-Ramsey if every 2-coloring of the edges of G contains a monochromatic copy of H. In general, Ramsey theory studies minimal H-Ramsey graphs: the classical

Title Deception human behavior and technology Dispatches from the front lines Guest Speaker Professor Mark Frank University at Buffalo Time 12 00 1 30 pm Abstract Security contexts involve observing human beings and trying to ascertain hostile intentions including efforts to deceive security personnel Although there is no Pinocchio response

Let B(m, n) be the number of ways to colour a 2m \times 2n grid in black and white so that, in each row and each column, half of the

We explore the framework of contract design through a computational perspective. Contract design is a fundamental pillar of microeconomics, addressing the essential question of how to incentivize individuals effectively. The

Finding hay in a haystack can be surprisingly difficult when no one can agree which hay is the right hay. Parallel algorithms are often better at finding a needle in

We seek algorithms for program learning that are both sample-efficient and computationally feasible. Classical results show that targets admitting short program descriptions (e.g., with short "python code") can be learned

VC-dimension is an important notion with several applications in graph theory. A fundamental result is that graphs of bounded VC dimension have (small) homogeneous vertex-partitions, i.e., partitions where almost every

Physicists have been using computers extensively both for simulations and numerical calculations. I will describe the on-going effort of harnessing the power of symbolic computation to further our knowledge of

This talk introduces Goedel-Prover-V2, an open-source model that sets a new state of the art in automated theorem proving.

We will see examples of how graphs arise in descriptive set theory and look at least one example of when the Borel chromatic number of a graph differs from the