On kaleidoscopic pseudo-randomness of finite Euclidean graphs
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
