I spent the last few days in vain using several spectral arguments to bound the size of certain intersection problems. For instance what is the largest set of vectors in $ {\{ 0, 1 \}^4}$ pairwise at Hamming distance at most $ {2}$ (a problem solved by Kleitman, recently investigated by Huang, Klurman and Pohoata). […]