SCHWEITZER 1986 Problem 9
Consider a latticelike packing of translates of a convex region . Let be the area of the fundamental parallelogram of the lattice defining the packing, and let denote the minimal value of taken for all latticelike packings. Is there a natural number such that for any and for any different from a parallelogram, is smaller that the area of any convex domain in which translates to can be placed without overlapping? (By a latticelike packing of we mean a set of nonoverlapping translates of obtained from by translations with all vectors of a lattice.) [G. and L. Fejes-Toth]
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.