Related papers: Squares and difference sets in finite fields
For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…
It has been conjectured by Sarkozy that with finitely many exceptions, the set of quadratic residues modulo a prime $p$ cannot be represented as a sumset $\{a+b\colon a\in A, b\in B\}$ with non-singleton sets $A,B\subset F_p$. The case…
In our paper, we apply additive-combinatorial methods to study the distribution of the set of squares $\mathcal{R}$ in the prime field. We obtain the best upper bound on the number of gaps in $\mathcal{R}$ at the moment and generalize this…
A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…
Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…
It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let $g$ be a positive integer and $p,p_{1},\ldots, p_{g}$ be distinct odd primes, the present paper…
Let $A\subseteq \mathbb{Z}_p^2$ be a set of size $2p+1$ for prime $p\geq 5$. In this paper, we prove that $A\hat{+}A=\{a_1+a_2\mid a_1,a_2\in A, a_1\neq a_2\}$ has cardinality at least $4p$. This result is the first advancement in over two…
For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…
The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…
For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…
Let $\mathcal{R}$ be a finite set of integers satisfying appropriate local conditions. We show the existence of long clusters of primes $p$ in bounded length intervals with $p-b$ squarefree for all $b \in \mathcal{R}$. Moreover, we can…
By constructing suitable nonnegative exponential sums we give upper bounds on the cardinality of any set $B_q$ in cyclic groups $\ZZ_q$ such that the difference set $B_q-B_q$ avoids cubic residues modulo $q$.
We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…
Denote by $\mathcal{R}_p$ the set of all quadratic residues in $\mathbf{F}_p$ for each prime $p$. A conjecture of A. S\'ark\"ozy asserts, for all sufficiently large $p$, that no subsets $\mathcal{A},\mathcal{B}\subseteq\mathbf{F}_p$ with…
In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+\epsilon}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.
We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…
In 2000, L. H\'{e}thelyi and B. K\"{u}lshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the…
Every finite group whose order is divisible by a prime $p$ has at least $2 \sqrt{p-1}$ conjugacy classes.
Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show…
We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…