PDF (Version of Record)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
|Google Scholar:||Look up in Google Scholar|
We present both probabilistic and constructive lower bounds on the maximum size of a set of points such that every angle determined by three points in is acute, considering especially the case . These results improve upon a probabilistic lower bound of Erdős and Füredi. We also present lower bounds for some generalisations of the acute angles problem, considering especially some problems concerning colourings of sets of integers.
|Item Type:||Journal Article|
|Copyright Holders:||2006 David Bevan|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
|Depositing User:||David Bevan|
|Date Deposited:||31 May 2012 08:46|
|Last Modified:||24 Feb 2016 18:00|
|Share this page:|
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.