Siegel’s Lemma and Sum-Distinct Sets
- First Online:
- Cite this article as:
- Aliev, I. Discrete Comput Geom (2008) 39: 59. doi:10.1007/s00454-008-9059-9
- 66 Views
This result also implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erdös–Moser problem). The main tools are the Minkowski theorem on successive minima and the Busemann theorem from convex geometry.