-
Rényi, Kutyás terem + Zoom
-
-
-
-
-
-

Description

Abstract:

Let us consider the k-colorings of Z^d. Is there an upper bound for the volume of the minimal non-singular simplex with monochromatic set of vertices? We show that k/d! is the sharp upper bound. At the same time we are going to investigate some related questions, including the size of the minimal lattice cube containing a simplex with this property.

 

The lecture can be followed by zoom if necessary: