scientific article; zbMATH DE number 1380581
From MaRDI portal
Publication:4705316
DOI<351::AID-RSA3>3.0.CO;2-S 10.1002/(SICI)1098-2418(199807)12:4<351::AID-RSA3>3.0.CO;2-SzbMath0958.52004MaRDI QIDQ4705316
Publication date: 19 December 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (34)
On series of signed vectors and their rearrangements ⋮ Constructive Discrepancy Minimization by Walking on the Edges ⋮ The equality cases of the Ehrhard-Borell inequality ⋮ Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries ⋮ A note on norms of signed sums of vectors ⋮ The Phase Transition of Discrepancy in Random Hypergraphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ LARGE SIGNED SUBSET SUMS ⋮ Near-optimal coresets of kernel density estimates ⋮ The discrepancy of random rectangular matrices ⋮ Vector balancing in Lebesgue spaces ⋮ The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant ⋮ Homeomorphisms and Fourier expansion ⋮ Discrepancy theory and related algorithms ⋮ TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES ⋮ Constructive Discrepancy Minimization for Convex Sets ⋮ A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture ⋮ An Improvement of the Beck–Fiala Theorem ⋮ On the discrepancy of random matrices with many columns ⋮ The Kadison-Singer problem in discrepancy theory. ⋮ An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound ⋮ Selectively balancing unit vectors ⋮ A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension ⋮ A probabilistic approach to the geometry of the \(\ell^n_p\)-ball ⋮ Semidefinite optimization in discrepancy theory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Better Bin Packing Approximations via Discrepancy Theory ⋮ Gaussian discrepancy: a probabilistic relaxation of vector balancing ⋮ Upper and lower bounds for matrix discrepancy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithmic Aspects of Combinatorial Discrepancy ⋮ The remote set problem on lattices
This page was built for publication:
