Distance sets of two subsets of vector spaces over finite fields
classification
🧮 math.CO
keywords
subsetsfinitedistancefieldssizespacesvectorbound
read the original abstract
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we improve upon the results by Rainer Dietmann. In the case that one of the subsets is a product set, we obtain further improvement on the estimate.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.