Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.
On the number of orthogonal systems in vector spaces over finite fields.
On kaleidoscopic pseudo-randomness of finite Euclidean graphs
D. Hart, A. Iosevich, D. Koh, S. Senger and I. Uriarte-Tuero (2008) showed that the distance graphs has kaleidoscopic pseudo-random property, i.e. sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations. In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods.
A note on multiplicatively e-perfect numbers.
On Fibonacci-like sequences.
Page 1