2 citations · 3 across the 3 of their papers we have counts for
12 papers · 1 filter
The Erdös-Falconer distance problem on the unit sphere in vector spaces over finite fields
Le Anh Vinh
art, Iosevich, Koh and Rudnev (2007) show, using Fourier analysis method, that the finite Erdös-Falconer distance conjecture holds for subsets of the unit sphere in $\mathbbm{F}_q^…
The number of occurrences of a fixed spread among n directions in vector spaces over finite fields
Le Anh Vinh
We study a finite analog of a problem of Erdos, Hickerson and Pach on the maximum number of occurrences of a fixed angle among n directions in three-dimensional spaces.
On the sum of the squared multiplicities of the distances in a point set over finite fields
Le Anh Vinh, Dang Phuong Dung
We study a finite analog of a conjecture of Erdös on the sum of the squared multiplicities of the distances determined by an -element point set. Our result is based on an estima…
On kaleidoscopic pseudo-randomness of finite Euclidean graphs
Le Anh Vinh
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-di…
On a Furstenberg-Katznelson-Weiss type theorem over finite fields
Le Anh Vinh
Using Fourier analysis, Covert, Hart, Iosevich and Uriarte-Tuero (2008) showed that if the cardinality of a subset of the 2-dimensional vector space over a finite field with q elem…
Explicit tough Ramsey graphs
Le Anh Vinh, Dang Phuong Dung
A graph G is t-tough if any induced subgraph of it with x > 1 connected components is obtained from G by deleting at least tx vertices. Chvatal conjectured that there exists an abs…