The Open UniversitySkip to content
 

Sets of points determining only acute angles and some related colouring problems

Bevan, David (2006). Sets of points determining only acute angles and some related colouring problems. Electronic Journal of Combinatorics, 13(1) R12/1-R12/24.

Full text available as:
[img]
Preview
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (225Kb)
URL: http://www.combinatorics.org/ojs/index.php/eljc/ar...
Google Scholar: Look up in Google Scholar

Abstract

We present both probabilistic and constructive lower bounds on the maximum size of a set of points {S \subseteq \R^d} such that every angle determined by three points in {S} is acute, considering especially the case {S \subseteq \{0,1\}^d}. 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
ISSN: 1077-8926
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Related URLs:
Item ID: 33661
Depositing User: David Bevan
Date Deposited: 31 May 2012 08:46
Last Modified: 24 Feb 2016 18:00
URI: http://oro.open.ac.uk/id/eprint/33661
Share this page:

► Automated document suggestions from open access sources

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.

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk