Selectively balancing unit vectors
From MaRDI portal
Abstract: A set of unit vectors is selectively balancing if one can find two disjoint subsets and , not both empty, such that the Euclidean distance between the sum of and the sum of is smaller than . We prove that the minimum number of unit vectors that guarantee a selectively balancing set in is asymptotically .
Recommendations
- Balancing unit vectors
- Balancing sets of vectors
- Balancing sets of vectors
- Balancing Gaussian vectors
- Balancing vectors in the max norm
- On some vector balancing problems
- Vector balancing in Lebesgue spaces
- Balancing vectors and convex bodies
- scientific article; zbMATH DE number 2196442
- Balancing sums of random vectors
Cites work
- scientific article; zbMATH DE number 1380581 (Why is no real title available?)
- Balancing families of integer sequences
- Balancing games
- Balancing unit vectors
- Balancing unit vectors
- Balancing vectors and convex bodies
- Balancing vectors in the max norm
- Combinatorial Properties of Associated Zonotopes
- Computing the Continuous Discretely
- Dot product dimensions of graphs
- Dot product representations of graphs
- On some combinatorial questions in finite-dimensional spaces
- On some vector balancing problems
- Six Standard Deviations Suffice
This page was built for publication: Selectively balancing unit vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747993)