Siegel's Lemma and sum-distinct sets

DOI10.1007/S00454-008-9059-9MaRDI QIDQ2482215zbMATH OpenOpenAlexWikidataFDO

Authors Iskander Aliev

Publication date 16 April 2008

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-008-9059-9

zbMATH Keywords

convex geometrygeometry of numbersminima of integer formssum-distinct sets

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Minima of forms (11H50)

Recommendations

• scientific article
• Siegel's lemma is sharp
• Alternative approach for Siegel's lemma
• Siegel's lemma is sharp for almost all linear systems
• On Siegel's lemma

Cites work

• A property of polynomials with an application to Siegel's lemma
• An improved lower bound on the greatest element of a sum-distinct set of fixed order
• Cube Slices, Pictorial Triangles, and Probability
• Cube Slicing in R n
• Evaluation of the Integral I n (b) = 2 π � ∞ 0 � � � sinx x � � � n   cos(bx) dx
• scientific article; zbMATH DE number 3121715 (Why is no real title available?)
• scientific article; zbMATH DE number 3121728 (Why is no real title available?)
• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 819723 (Why is no real title available?)
• Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
• On a decomposition of integer vectors. I
• On Siegel's lemma
• Some remarkable properties of sinc and related integrals
• Unsolved problems in number theory

Cited in

(16)

• Variations on the Erdős distinct-sums problem
• Recursive convolutions of unit rectangle function and some applications
• Counting set classes with Burnside's lemma
• On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes
• Minimum-weight edge discriminators in hypergraphs
• Weights of exact threshold functions
• Sparse Solutions of Linear Diophantine Equations
• A Note on the Erdös Distinct Subset Sums Problem
• Some remarks on the Erdős Distinct subset sums problem
• Sum-distinguishing number of sparse hypergraphs
• Minkowski's successive minima in convex and discrete geometry
• Convexity properties of sections of 1-symmetric bodies and Rademacher sums
• Variants of the Erdős distinct sums problem and variance method
• Higher degree Erdős distinct evaluations problem (extended abstract)
• The Erdõs distinct subset sums problem in a modular setting
• On the volume of hyperplane sections of a d-cube

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Siegel's Lemma and sum-distinct sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482215)