On kaleidoscopic pseudo-randomness of finite Euclidean graphs

Details On kaleidoscopic pseudo-randomness of finite Euclidean graphs On kaleidoscopic pseudo-randomness of finite Euclidean graphs

2008-07-17

arxiv.org/abs/0807.2689v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On kaleidoscopic pseudo-randomness of finite Euclidean graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On kaleidoscopic pseudo-randomness of finite Euclidean graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On kaleidoscopic pseudo-randomness of finite Euclidean graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41918