Siegel's lemma is sharp
DOI10.1007/978-3-319-44479-6_8zbMATH Open1441.11178OpenAlexW2762433659MaRDI QIDQ4604374FDOQ4604374
Authors: József Beck 
Publication date: 26 February 2018
Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44479-6_8
Recommendations
Enumerative combinatorics (05A99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Simultaneous homogeneous approximation, linear forms (11J13) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
- Title not available (Why is that?)
- Estimates for the concentration function of combinatorial number theory and probability
- Title not available (Why is that?)
- Six Standard Deviations Suffice
- On Siegel's lemma
- Diophantine approximations and diophantine equations
- On a lemma of Littlewood and Offord
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- The best constant in Siegel's Lemma
- Title not available (Why is that?)
- Bounds for solutions of systems of linear equations
- Coins with Arbitrary Weights
Cited In (11)
- A property of polynomials with an application to Siegel's lemma
- Title not available (Why is that?)
- On Diophantine exponents and Khintchine's transference principle
- On Siegel's lemma
- Applications of Siegel's lemma to a system of linear forms and its minimal points
- On Siegel's lemma and linear spaces of random variables
- Siegel's Lemma and sum-distinct sets
- Alternative approach for Siegel's lemma
- A note on Siegel's lemma over number fields
- Title not available (Why is that?)
- Siegel's lemma is sharp for almost all linear systems
This page was built for publication: Siegel's lemma is sharp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604374)
