Selectively balancing unit vectors

From MaRDI portal



Abstract: A set U of unit vectors is selectively balancing if one can find two disjoint subsets U+ and U−, not both empty, such that the Euclidean distance between the sum of U+ and the sum of U− is smaller than 1. We prove that the minimum number of unit vectors that guarantee a selectively balancing set in mathbbRn is asymptotically frac12nlogn.


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.











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)