## January 2020

### Ben Lund, Furstenberg sets over finite fields

Room B232 IBS (기초과학연구원)

An important family of incidence problems are discrete analogs of deep questions in geometric measure theory. Perhaps the most famous example of this is the finite field Kakeya conjecture, proved by Dvir in 2008. Dvir's proof introduced the polynomial method to incidence geometry, which led to the solution to many long-standing problems in the area.

## August 2020

### Ben Lund, Point-plane incidence bounds

Room B232 IBS (기초과학연구원)

In the early 1980s, Beck proved that, if P is a set of n points in the real plane, and no more than g points of P lie on any single line, then there are $\Omega(n(n-g))$ lines that each contain at least 2 points of P. In 2016, I found a generalization of this theorem,

## January 2021

### Ben Lund, Perfect matchings and derangements on graphs

Room B232 IBS (기초과학연구원)

We show that each perfect matching in a bipartite graph G intersects at least half of the perfect matchings in G. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of derangements and permutations on graphs. We give several related results and open questions. This

## May 2021

### Ben Lund, Limit shape of lattice Zonotopes

Room B232 IBS (기초과학연구원)

A convex lattice polytope is the convex hull of a set of integral points. Vershik conjectured the existence of a limit shape for random convex lattice polygons, and three proofs of this conjecture were given in the 1990s by Bárány, by Vershik, and by Sinai. To state this old result more precisely, there is a

## November 2021

### Ben Lund, Maximal 3-wise intersecting families

Room B232 IBS (기초과학연구원)

A family $\mathcal F$ of subsets of {1,2,…,n} is called maximal k-wise intersecting if every collection of at most k members from $\mathcal F$ has a common element, and moreover, no set can be added to $\mathcal F$ while preserving this property. In 1974, Erdős and Kleitman asked for the smallest possible size of a

## March 2022

### Ben Lund, Thresholds for incidence properties in finite vector spaces

Room B232 IBS (기초과학연구원)

Suppose that $E$ is a subset of $\mathbb{F}_q^n$, so that each point is contained in $E$ with probability $\theta$, independently of all other points. Then, what is the probability that there is an $m$-dimensional affine subspace that contains at least $\ell$ points of $E$? What is the probability that $E$ intersects all $m$-dimensional affine subspaces?

## June 2022

### Ben Lund, Radial projections in finite space

Room B332 IBS (기초과학연구원)

Given a set $E$ and a point $y$ in a vector space over a finite field, the radial projection $\pi_y(E)$ of $E$ from $y$ is the set of lines that through $y$ and points of $E$. Clearly, $|\pi_y(E)|$ is at most the minimum of the number of lines through $y$ and $|E|$. I will discuss 기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209