Combinatorics Seminar: Recent results on the queen packing problem
Seminar | February 27 | 12:10-1 p.m. | 939 Evans Hall
Daniel Kane, UCSD
We consider the problem of placing $k$ queens on an $n \times n$ chessboard so that the number of unattacked squared is as large as possible. We focus on the domain where $k$ is small relative to $n$. We are able to solve this problem by relating it to various related problems in additive combinatorics.