Abstract
We show that for every integer d there is a set of points in Ed of size Ω ((frac(2, sqrt(3)))d sqrt(d)) such that every angle determined by three points in the set is smaller than π / 2. This improves the best known lower bound by a Θ (sqrt(d)) factor.
Original language | English |
---|---|
Pages (from-to) | 908-910 |
Number of pages | 3 |
Journal | European Journal of Combinatorics |
Volume | 30 |
Issue number | 4 |
DOIs | |
State | Published - May 2009 |
Externally published | Yes |
Bibliographical note
Funding Information:We thank Guy Wolfovitz for helpful discussions, specifically, for suggesting using [6] instead of [8] in order to simplify the proof of Theorem 1 . The first author was supported by a fellowship from the Alexander von Humboldt Foundation.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics