On kaleidoscopic pseudo-randomness of finite Euclidean graphs
classification
🧮 math.CO
keywords
finiteeuclideangraphskaleidoscopicpseudo-randomnessconfigurationscontaind-dimensional
read the original abstract
In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations.
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.