中文
相关论文

相关论文: An explicit sum-product estimate in $\mathbb{F}_p$

200 篇论文

We prove, using combinatorics and Kloosterman sum technology that if $A \subset {\Bbb F}_q$, a finite field with $q$ elements, and $q^{{1/2}} \lesssim |A| \lesssim q^{{7/10}}$, then $\max \{|A+A|, |A \cdot A|\} \gtrsim…

组合数学 · 数学 2007-05-23 D. Hart , A. Iosevich , J. Solymosi

We prove that for sets $A, B, C \subset \mathbb{F}_p$ with $|A|=|B|=|C| \leq \sqrt{p}$ and a fixed $0 \neq d \in \mathbb{F}_p$ holds $$ \max(|AB|, |(A+d)C|) \gg|A|^{1+1/26}. $$ In particular, $$ |A(A+1)| \gg |A|^{1 + 1/26} $$ and $$…

数论 · 数学 2015-07-21 Dmitrii Zhelezov

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

数论 · 数学 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

组合数学 · 数学 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

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…

数论 · 数学 2015-02-25 Vsevolod F. Lev , Jack Sonn

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a…

组合数学 · 数学 2014-01-09 Brendan Murphy , Oliver Roche-Newton , Ilya D. Shkredov

In this paper we study some products related to quadratic residues and quartic residues modulo primes. Let $p$ be an odd prime and let $A$ be any integer. We mainly determine completely the product $$f_p(A):=\prod_{1\le i,j\le(p-1)/2\atop…

数论 · 数学 2020-09-11 Zhi-Wei Sun

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

数论 · 数学 2026-04-21 Xuancheng Shao

In this paper, we prove that the bound \[ \max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}-o(1)} \] holds for all $A \subset \mathbb R$, and for all convex functions $f$ which satisfy an additional technical condition.…

组合数学 · 数学 2023-04-04 Oliver Roche-Newton

These notes arose from my Cambridge Part III course on Additive Combinatorics, given in Lent Term 2009. The aim was to understand the simplest proof of the Bourgain-Glibichuk-Konyagin bounds for exponential sums over subgroups. As a…

数论 · 数学 2009-04-15 Ben Green

Let $A$ be a finite subset of $\ffield$, the field of Laurent series in $1/t$ over a finite field $\mathbb{F}_q$. We show that for any $\epsilon>0$ there exists a constant $C$ dependent only on $\epsilon$ and $q$ such that…

数论 · 数学 2013-03-05 Thomas Bloom , Timothy G. F. Jones

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

组合数学 · 数学 2014-02-25 Antal Balog , Oliver Roche-Newton

Let $F$ be a field of characteristic $p>2$ and $A\subset F$ have sufficiently small cardinality in terms of $p$. We improve the state of the art of a variety of sum-product type inequalities. In particular, we prove that $$ |AA|^2|A+A|^3…

组合数学 · 数学 2015-12-22 Esen Aksoy Yazici , Brendan Murphy , Misha Rudnev , Ilya Shkredov

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

数论 · 数学 2025-09-01 Moubariz Z. Garaev , Julio C. Pardo

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

数论 · 数学 2025-07-02 Brandon Hanson , Misha Rudnev , Ilya Shkredov , Dmitrii Zhelezov

Let $\mathbb{F}_p$ be a prime field of order $p,$ and $A$ be a set in $\mathbb{F}_p$ with $|A| \leq p^{1/2}.$ In this note, we show that \[\max\{|A+A|, |f(A, A)|\}\gtrsim |A|^{\frac{6}{5}+\frac{4}{305}},\] where $f(x, y)$ is a…

组合数学 · 数学 2019-04-17 Mozhgan Mirzaei

Let $A \subset \mathbb{R}$ be finite. We quantitatively improve the Balog-Wooley decomposition, that is $A$ can be partitioned into sets $B$ and $C$ such that $$\max\{E^+(B) , E^{\times}(C)\} \lesssim |A|^{3 - 7/26}, \ \ \max \{E^+(B,A) ,…

数论 · 数学 2019-10-23 George Shakan

We provide a new exponent for the Sum-Product conjecture on $\mathbb{R} $. Namely for $A \subset \mathbb{R}$ finite, \[ \max \left\{ \left\lvert A+A \right\rvert , \left\lvert AA \right\rvert \right\} \gg_{\epsilon} \left\lvert A…

组合数学 · 数学 2026-02-02 Adam Cushman

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

组合数学 · 数学 2007-05-23 Van Vu

Let $t:\mathbb{F}_{p}\rightarrow\mathbb{C}$ be a complex valued function on $\mathbb{F}_{p}$. A classical problem in analytic number theory is to bound the maximum of the absolute value of the incomplete sum \[ M(t):=\max_{0\leq…

数论 · 数学 2021-07-01 Dante Bonolis