Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COMBINATORICS
2006

favoriteEmaildiscussreport

105views more COMBINATORICS 2006»

Sets of Points Determining Only Acute Angles and Some Related Colouring Problems

13 years 4 months ago

Sets of Points Determining Only Acute Angles and Some Related Colouring Problems

Download www.combinatorics.org

We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considering especially the case S {0, 1}d. These results improve upon a probabilistic lower bound of Erdos and F

David Bevan

Real-time Traffic

COMBINATORICS 2006 | Lower Bounds | Maximum Size | Probabilistic |

claim paper

Related Content

» On distinct distances among points in general position and other related problems

» Properties of Support Vector Machines

» UserGuided Shape from Shading to Reconstruct Fine Details from a Single Photograph

» Learning Multicategory Classification in Bayesian Framework

» Locating Active Sensors on Traffic Networks

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	David Bevan

Comments (0)