Selectively balancing unit vectors
A set \(U\) of unit vectors is called selectively balancing if one can select two disjoint subsets \(U^{+}\) and \(U^{-}\), not both empty, such that Euclidean distance between the sum of \(U^{+}\) and the sum of \(U^{-}\) is less than 1. In this paper, the authors try to balance unit vectors in the \(n\)-dimensional Euclidean space. Let \(\sigma(n)\) denote the minimum number such that any \(\sigma(n)\) unit vectors in \(\mathbb{R}^n\) are selectively balancing. It is proved that \(\sigma(n)\) is asymptotically \(\frac12 n\log n\). The results can be applied to the dot product representation of cube graphs.
- 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
- 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
- scientific article; zbMATH DE number 1380581 (Why is no real title available?)
- 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)