Add to ORKGWe have the Fisher type inequality and the linear programming bound as upper bounds for the cardinalities of s-distance sets on Sd−1. In this paper, we give a new upper bound for the cardinalities of s-distance sets on Sd−1 for any s. This upper bound improves the Fisher typer inequality and is useful for s-distance sets which are not applicable to the linear programming bound.
AbstractA subset X in k-dimensional Euclidean space Rk is called an s-distance set if there are exac...
AbstractWe derive a new estimate of the size of finite sets of points in metric spaces with few dist...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...
We have the Fisher type inequality and the linear programming bound as upper bounds for the cardinal...
AbstractA finite set X in a metric space M is called an s-distance set if the set of distances betwe...
AbstractA finite set X in a metric space M is called an s-distance set if the set of distances betwe...
AbstractA subset X in the d-dimensional Euclidean space is called a k-distance set if there are exac...
Using the method of linearly independent polynomials, we derive an upper bound for the cardinality o...
AbstractA finite set X in the d-dimensional Euclidean space is called an s-distance set if the set o...
AbstractA subset X in the d-dimensional Euclidean space is called a k-distance set if there are exac...
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets sta...
The maximum cardinality of a code of length n over an alphabet of size q and with s distinct distanc...
Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pairs of points in...
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the...
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the...
AbstractA subset X in k-dimensional Euclidean space Rk is called an s-distance set if there are exac...
AbstractWe derive a new estimate of the size of finite sets of points in metric spaces with few dist...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...
We have the Fisher type inequality and the linear programming bound as upper bounds for the cardinal...
AbstractA finite set X in a metric space M is called an s-distance set if the set of distances betwe...
AbstractA finite set X in a metric space M is called an s-distance set if the set of distances betwe...
AbstractA subset X in the d-dimensional Euclidean space is called a k-distance set if there are exac...
Using the method of linearly independent polynomials, we derive an upper bound for the cardinality o...
AbstractA finite set X in the d-dimensional Euclidean space is called an s-distance set if the set o...
AbstractA subset X in the d-dimensional Euclidean space is called a k-distance set if there are exac...
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets sta...
The maximum cardinality of a code of length n over an alphabet of size q and with s distinct distanc...
Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pairs of points in...
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the...
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the...
AbstractA subset X in k-dimensional Euclidean space Rk is called an s-distance set if there are exac...
AbstractWe derive a new estimate of the size of finite sets of points in metric spaces with few dist...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...