Anurag's Math Blog

I have often heard mathematicians saying, “We do not like politics” and “We just want to focus on research”.

We are advertising a 3 year postdoctoral position at the University of Western Australia to work at the interface of finite geometry and Ramsey theory.

One of the oldest open problem in Ramsey theory has been solved.

A sensational Ramsey breakthrough by Domagoj Bradač

The following post is (partly) based on discussions with Dion Gijswijt and Ananth Ravi from September 2025.

In this post, I will discuss a recent breakthrough of Hunter, Pohoata, Verstraete and Zhang on an old problem in finite geometry, which also has interesting consequences outside this area.

I am hiring people on my NWO Vidi project.

What is the minimum number of colors needed to color the points of the Fano plane such that there is no monochromatic line?

How many swaps do you need to sort objects on a circle in clockwise order?

Blocking sets are one of the central topics in finite geometry, which was originally introduced in the context of game theory under the name of `blocking coalitions’: On Finite Projective Games.