J. Chapman

most citedPinned distance sets, k-simplices, Wolff's exponent in finite fields and sum-product estimates

5 citations · 7 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2014★ 2 cited

Long paths in the distance graph over large subsets of vector spaces over finite fields

M. Bennett, J. Chapman, D. Covert +3

Let $E \subset F_{q}^{d}$ , the $d$ -dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$ , by letting the vertices b…

math.CO2009★ 5 cited

Pinned distance sets, k-simplices, Wolff's exponent in finite fields and sum-product estimates

Jeremy Chapman, M. Burak Erdogan, Derrick Hart +2

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold $α > 0$ such that $∣Δ (E) ∣ ≳ q$ whenever $∣ E ∣ ≳ q^{α}$ , where $E \subse…