On some vector balancing problems
From MaRDI portal
Given origin symmetric \(n\)-dimensional convex bodies \(U\) and \(V\), let \(\beta (U,V)\) stand for the least \(r\) meeting the condition \[ (\forall u_1, \dots , u_n \in U) (\exists {\varepsilon}_1, \dots, {\varepsilon}_n \in \{-1,1\})\;{\varepsilon}_1 u_1 +\dots +{\varepsilon}_n u_n \in rV. \] The balancing problem consists in estimating \(\beta (U,V)\). The author provides solutions to the problem in the case when \(U\) is the ball of \(\mathbb R^n\).
Recommendations
Cited in
(20)- Selectively balancing unit vectors
- The convexification effect of Minkowski summation
- Balanced configurations of \(2 n + 1\) plane vectors
- Gaussian discrepancy: a probabilistic relaxation of vector balancing
- Balanced states in vector optimization problems
- The product of octahedra is badly approximated in the \(\ell_{2,1}\)-metric
- A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture
- On series of signed vectors and their rearrangements
- Constructive Discrepancy Minimization for Convex Sets
- Balanced Optimization with Vector Costs
- Balancing vectors and convex bodies
- Towards a constructive version of Banaszczyk's vector balancing theorem
- scientific article; zbMATH DE number 1380581 (Why is no real title available?)
- The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding
- A greedy algorithm for quantizing neural networks
- Towards a constructive version of Banaszczyk's vector balancing theorem
- Vector balancing in Lebesgue spaces
- Discrepancy theory and related algorithms
- An example related to the slicing inequality for general measures
- Recent results on well-balanced orientations
This page was built for publication: On some vector balancing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337997)
