Siegel's Lemma and Sum-Distinct Sets
Number Theory
2007-05-23 v3 Combinatorics
Abstract
We 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\"os-Moser problem). The main tools are Minkowski's theorem on successive minima and the Busemann theorem from convex geometry.
Keywords
Cite
@article{arxiv.math/0503115,
title = {Siegel's Lemma and Sum-Distinct Sets},
author = {Iskander Aliev},
journal= {arXiv preprint arXiv:math/0503115},
year = {2007}
}
Comments
10 pages, corrected typos