Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by placing m points in Rd? A simple degrees of freedom argument shows that m points in R2 cannot realise more than 2m - 4 general angles. We give a construction to show that this bound is sharp when m ≥ 5. In d dimensions the degrees of freedom argument gives an upper bound of dm−(d+12) general angles. However, the above result does not generalise to this case; surprisingly, the bound of 2m-4 from two dimensions cannot be improved at all. Indeed, our main result is that there are sets of 2m - 3 angles that cannot be realised by m points in any dimension
We show that every graph of maximum degree three can be drawn in three dimensions with at most two b...
We show that every graph of maximum degree three can be drawn in three dimensions with at most two b...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by ...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
In a previous paper we showed that, for any n ≥ m + 2, most sets of n points in R m are determined (...
In computational metrology one needs to compute whether an object satisfies specifications of shape ...
We solve the problem of finding a sharp upper bound on the minimum angle formed by $N$ points in the...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Most students enjoy the topic of geometrical constructions using compass and ruler. When it comes to...
In $1979$ Conway, Croft, Erd\H{o}s and Guy proved that every set $S$ of $n$ points in general positi...
It is well known that there is no general procedure for trisecting an angle using only a compass an...
AbstractErdős asked the following question: is it true that a set of n2 points in the plane always c...
In this note we show that a planar graph with angular resolution at least π/2 can be drawn with all...
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less ...
We show that every graph of maximum degree three can be drawn in three dimensions with at most two b...
We show that every graph of maximum degree three can be drawn in three dimensions with at most two b...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by ...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
In a previous paper we showed that, for any n ≥ m + 2, most sets of n points in R m are determined (...
In computational metrology one needs to compute whether an object satisfies specifications of shape ...
We solve the problem of finding a sharp upper bound on the minimum angle formed by $N$ points in the...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Most students enjoy the topic of geometrical constructions using compass and ruler. When it comes to...
In $1979$ Conway, Croft, Erd\H{o}s and Guy proved that every set $S$ of $n$ points in general positi...
It is well known that there is no general procedure for trisecting an angle using only a compass an...
AbstractErdős asked the following question: is it true that a set of n2 points in the plane always c...
In this note we show that a planar graph with angular resolution at least π/2 can be drawn with all...
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less ...
We show that every graph of maximum degree three can be drawn in three dimensions with at most two b...
We show that every graph of maximum degree three can be drawn in three dimensions with at most two b...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...