Siegel's Lemma and Sum-Distinct Sets

Simple item page
dc.creatorAliev, Iskander
dc.date2005-03-06
dc.date2005-10-08
dc.date.accessioned2026-07-07T06:39:32Z
dc.date.available2026-07-07T06:39:32Z
dc.descriptionWe give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This 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 Minkowski's theorem on successive minima and the Busemann theorem from convex geometry.
dc.description10 pages, corrected typos
dc.identifierhttps://arxiv.org/abs/math/0503115
dc.identifierhttp://arxiv.org/abs/math/0503115
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101110
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11H06; 11P70
dc.titleSiegel's Lemma and Sum-Distinct Sets
dc.typetext

Files

Collections

arXiv