Siegel's Lemma and sum-distinct sets
From MaRDI portal
Publication:2482215
DOI10.1007/s00454-008-9059-9zbMath1184.11022OpenAlexW2166542595WikidataQ124880224 ScholiaQ124880224MaRDI QIDQ2482215
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
Related Items
Weights of exact threshold functions ⋮ On the volume of hyperplane sections of a \(d\)-cube ⋮ Recursive convolutions of unit rectangle function and some applications ⋮ Minimum-weight edge discriminators in hypergraphs ⋮ Some remarks on the Erdős Distinct subset sums problem ⋮ Sum-distinguishing number of sparse hypergraphs ⋮ On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes ⋮ Sparse Solutions of Linear Diophantine Equations ⋮ A Note on the Erdös Distinct Subset Sums Problem ⋮ Variations on the Erdős distinct-sums problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Siegel's lemma
- An improved lower bound on the greatest element of a sum-distinct set of fixed order
- A property of polynomials with an application to Siegel's lemma
- Cube Slicing in R n
- Cube Slices, Pictorial Triangles, and Probability
- Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
- [https://portal.mardi4nfdi.de/wiki/Publication:5524859 Evaluation of the Integral I n (b) = 2 π � ∞ 0 � � � sinx x � � � n cos(bx) dx]
- Unsolved problems in number theory
- Some remarkable properties of sinc and related integrals