Add to ORKGWe use exponential sums to obtain new lower bounds on the number of distinct distances defined by all pairs of points (a, b) ∈ A x B for two given sets A, B ⊆ Fn q where Fq is a finite field of q elements and n ≥1 is an integer.8 page(s
We investigate the size of the distance set determined by two subsets of finite dimensional vector s...
Let $K$ be an algebraic number field, and $\mathcal{O}_K$ the ring of integers of $K$. Let $X$ be a ...
AbstractFor the finite field Fq of q elements (q odd) and a quadratic non-residue (that is, a non-sq...
We use bounds of exponential sums to derive new lower bounds on the number of distinct distances bet...
Weuse bounds of exponential sums to derive new lower bounds on the number of distinct distances betw...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
We study the Erdös/Falconer distance problem in vector spaces over finite fields. Let Fq be a finit...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
AbstractThe paper (Discrete Comput. Geom. 25 (2001) 629) of Solymosi and Tóth implicitly raised the ...
We use character sums to derive new bounds on the additive energy of the set of distances (counted w...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...
We investigate the size of the distance set determined by two subsets of finite dimensional vector s...
Let $K$ be an algebraic number field, and $\mathcal{O}_K$ the ring of integers of $K$. Let $X$ be a ...
AbstractFor the finite field Fq of q elements (q odd) and a quadratic non-residue (that is, a non-sq...
We use bounds of exponential sums to derive new lower bounds on the number of distinct distances bet...
Weuse bounds of exponential sums to derive new lower bounds on the number of distinct distances betw...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
We study the Erdös/Falconer distance problem in vector spaces over finite fields. Let Fq be a finit...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
For a prime power $q$, let $\mathbb{F}_q$ be the finite field of $q$ elements. We show that \mathbb...
AbstractThe paper (Discrete Comput. Geom. 25 (2001) 629) of Solymosi and Tóth implicitly raised the ...
We use character sums to derive new bounds on the additive energy of the set of distances (counted w...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...
We investigate the size of the distance set determined by two subsets of finite dimensional vector s...
Let $K$ be an algebraic number field, and $\mathcal{O}_K$ the ring of integers of $K$. Let $X$ be a ...
AbstractFor the finite field Fq of q elements (q odd) and a quadratic non-residue (that is, a non-sq...