Abstract
Let v1, ..., v n be vectors in R n of max norm at most one. It is proven that there exists a choice of signs for which all partial sums have max norm at most Kn 1/2. It is further shown that such a choice of signs must be anticipatory-there is no way to choose the i-th sign without knowledge of v j for j>i.
Original language | English (US) |
---|---|
Pages (from-to) | 55-65 |
Number of pages | 11 |
Journal | Combinatorica |
Volume | 6 |
Issue number | 1 |
DOIs | |
State | Published - Mar 1986 |
Keywords
- AMS subject classification (1980): 05B20
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics