DOIAbstract
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that every angle determined by three points in the set is smaller than π/2. This improves the best known lower bound by a Θ(d) factor
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that every angle determined by three points in the set is smaller than π/2. This improves the best known lower bound by a Θ(d) factor
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
It is shown here that given a discrete (and infinite) set of points in the plane, it is possible to ...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S...
We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac...
For three points u, v and w in the n-dimensional space Fnq over the finite field Fq of q elements we...
We present a simple construction of an acute set of size 2d−1+1 in Rd for any dimension d. That is, ...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
AbstractWe find sharp absolute constants C1 and C2 with the following property: every well-rounded l...
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice o...
Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by ...
We solve the problem of finding a sharp upper bound on the minimum angle formed by $N$ points in the...
In $1979$ Conway, Croft, Erd\H{o}s and Guy proved that every set $S$ of $n$ points in general positi...
We show that for any ǫ> 0 there exists an angle α = α(ǫ) between 0 and π, depending only on ǫ, wi...
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
It is shown here that given a discrete (and infinite) set of points in the plane, it is possible to ...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
AbstractWe show that for every integer d there is a set of points in Ed of size Ω((23)dd) such that ...
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S...
We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac...
For three points u, v and w in the n-dimensional space Fnq over the finite field Fq of q elements we...
We present a simple construction of an acute set of size 2d−1+1 in Rd for any dimension d. That is, ...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
AbstractWe find sharp absolute constants C1 and C2 with the following property: every well-rounded l...
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice o...
Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by ...
We solve the problem of finding a sharp upper bound on the minimum angle formed by $N$ points in the...
In $1979$ Conway, Croft, Erd\H{o}s and Guy proved that every set $S$ of $n$ points in general positi...
We show that for any ǫ> 0 there exists an angle α = α(ǫ) between 0 and π, depending only on ǫ, wi...
In this paper we present three different results dealing with the number of ( ≤ k)-facets of a set o...
It is shown here that given a discrete (and infinite) set of points in the plane, it is possible to ...
AbstractIn this paper we present two different results dealing with the number of (≤k)-facets of a s...
Add to ORKG