ID: 1403.2589

Counting Additive Decompositions of Quadratic Residues in Finite Fields

March 11, 2014

View on ArXiv

Similar papers 3

A sum-product estimate in fields of prime order

April 16, 2003

85% Match
S. V. Konyagin
Number Theory

Let q be a prime, A be a subset of a finite field $F=\Bbb Z/q\Bbb Z$, $|A|<\sqrt{|F|}$. We prove the estimate $\max(|A+A|,|A\cdot A|)\ge c|A|^{1+\epsilon}$ for some $\epsilon>0$ and c>0. This extends the result of J. Bourgain, N. Katz, and T. Tao.

Find SimilarView on arXiv

Low-energy decomposition results over finite fields

February 2, 2021

85% Match
Ali Mohammadi, Sophie Stevens
Combinatorics
Number Theory

We prove various low-energy decomposition results, showing that we can decompose a finite set $A\subset \mathbb{F}_p$ satisfying $|A|<p^{5/8}$, into $A = S\sqcup T$ so that, for a non-degenerate quadratic $f\in \mathbb{F}_p[x,y]$, we have \[ |\{(s_1,s_2,s_3,s_4)\in S^4 : s_1 + s_2 = s_3 + s_4\}| \ll |A|^{3 - \frac15 + \varepsilon} \] and \[ |\{(t_1,t_2,t_3,t_4)\in T^4 : f(t_1, t_2) = f(t_3, t_4)\}|\ll |A|^{3 - \frac15 + \varepsilon}\,. \] Variations include extend...

Find SimilarView on arXiv

Capturing Forms in Dense Subsets of Finite Fields

November 25, 2012

85% Match
Brandon Hanson
Number Theory
Combinatorics

An open problem of arithmetic Ramsey theory asks if given a finite $r$-colouring $c:\mathbb{N}\to\{1,...,r\}$ of the natural numbers, there exist $x,y\in \mathbb{N}$ such that $c(xy)=c(x+y)$ apart from the trivial solution $x=y=2$. More generally, one could replace $x+y$ with a binary linear form and $xy$ with a binary quadratic form. In this paper we examine the analogous problem in a finite field $\mathbb{F}_q$. Specifically, given a linear form $L$ and a quadratic from $Q$...

Find SimilarView on arXiv

A note on the set $\boldsymbol{A(A+A)}$

November 21, 2018

84% Match
Pierre-Yves Bienvenu, François Hennecart, Ilya Shkredov
Number Theory

Let $p$ a large enough prime number. When $A$ is a subset of $\mathbb{F}_p\smallsetminus\{0\}$ of cardinality $|A|> (p+1)/3$, then an application of Cauchy-Davenport Theorem gives $\mathbb{F}_p\smallsetminus\{0\}\subset A(A+A)$. In this note, we improve on this and we show that if $|A|\ge 0.3051 p$ implies $A(A+A)\supseteq\mathbb{F}_p\smallsetminus\{0\}$. In the opposite direction we show that there exists a set $A$ such that $|A| > (1/8+o(1))p$ and $\mathbb{F}_p\smallsetminu...

Find SimilarView on arXiv

Slightly improved sum-product estimates in fields of prime order

July 12, 2009

84% Match
Liangpan Li
Number Theory
Combinatorics

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a nonempty subset of $\mathbb{F}_p$. In this paper we show that if $|A|\preceq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succeq|A|^{13/12};\] if $|A|\succeq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succapprox \min\{|A|^{13/12}(\frac{|A|}{p^{0.5}})^{1/12},|A|(\frac{p}{|A|})^{1/11}\}.\] These results slightly improve the estimates of Bourgain-Garaev and Shen. Sum-product estimates on differ...

Find SimilarView on arXiv

Large sumsets from small subsets

April 15, 2022

84% Match
Bela Bollobas, Imre Leader, Marius Tiba
Combinatorics

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and this is just one example of a large family of results. Our aim in this paper is to investigate what happens if we restrict the number of elements of one set that we may use to form the sums. Here is the question we set out to answer: given ...

Find SimilarView on arXiv

Quadratic Residues and Non-residues in Arithmetic Progression

November 9, 2011

84% Match
Steve Wright
Number Theory

Let S be an infinite set of non-empty, finite subsets of the nonnegative integers. If p is an odd prime, let c(p) denote the cardinality of the set {T {\in} S : T {\subseteq} {1,...,p-1} and T is a set of quadratic residues (respectively, non-residues) of p}. When S is constructed in various ways from the set of all arithmetic progressions of nonnegative integers, we determine the sharp asymptotic behavior of c(p) as p {\to} +{\infty}. Generalizations and variations of this a...

Find SimilarView on arXiv

Products of Small Integers in Residue Classes and Additive Properties of Fermat Quotients

August 20, 2014

84% Match
Glyn Harman, Igor E. Shparlinski
Number Theory

We show that for any $\varepsilon > 0$ and a sufficiently large cube-free $q$, any reduced residue class modulo $q$ can be represented as a product of $14$ integers from the interval $[1, q^{1/4e^{1/2} + \varepsilon}]$. The length of the interval is at the lower limit of what is possible before the Burgess bound on the smallest quadratic nonresidue is improved. We also consider several variations of this result and give applications to Fermat quotients.

Find SimilarView on arXiv

An improved sum-product estimate over finite fields

May 31, 2011

84% Match
Liangpan Li, Oliver Roche-Newton
Combinatorics

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new estimate matches, up to a logarithmic factor, the current best known bound obtained over prime fields by Rudnev (\cite{mishaSP}).

Find SimilarView on arXiv

An analogue of the prime number theorem for finite fields

August 23, 2013

84% Match
Hao Pan, Zhi-Wei Sun
Number Theory

We prove an analogue of the prime number theorem for finite fields.

Find SimilarView on arXiv