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:

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
Related URLs:	http://www.combinatorics.org/ojs/index.p...(Other)
Item ID:	33661
Depositing User:	David Bevan
Date Deposited:	31 May 2012 08:46
Last Modified:	02 Jun 2012 03:54
URI:	http://oro.open.ac.uk/id/eprint/33661

Actions (login may be required)

	View Item
	Public: Report issue / request change

Policies | Disclaimer