arXiv math/07036142007-03-20math.NTmath.CA

A Slight Improvement to Garaev's Sum Product Estimate

Nets Hawk Katz, Chun-Yen Shen

备注：: 6 pages

英文摘要：

We slightly improve Garaev's recent sum-product estimate largely by using Plunneke's inequality a little more efficiently. We improve the exponent from 15/14 to 14/13.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Garaev's Inequality in finite fields not of prime order

We prove a version of Garaev's sum product theorem in the set of finite fields with non-prime order. Because of the presence of subfields, this seems to require some hypotheses on the set. We work under a condition analogous to having Hausdorff dimension less than 1/2. Under these conditions, we obtain a sum-product theorem with exponent 49/48.

2007-03-22math.CAmath.NT

Slightly improved sum-product estimates in fields of prime order

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 different sets are also considered.

2009-07-12math.COmath.NT

A Szemerédi-Trotter type theorem, sum-product estimates in finite quasifields, and related results

We prove a Szemerédi-Trotter type theorem and a sum-product estimate in the setting of finite quasifields. These estimates generalize results of the fourth author, of Garaev, and of Vu. We generalize results of Gyarmati and Sárközy on the solvability of the equations $a + b = cd$ and $ab + 1 = cd$ over a finite field. Other analogous results that are known to hold in finite fields are generalized to finite quasifields.

2016-10-19math.COmath.NT

On Congruences with Products of Variables from Short Intervals and Applications

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_ν+s)\equiv (y_1+s)...(y_ν+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications of our results and in particular improve several recent estimates of J. Cilleruelo and M. Z. Garaev on exponential congruences and on cardinalities of products of short intervals, some double character sum estimates of J. B. Friedlander and H. Iwaniec and some results of M.-C. Chang and A. A. Karatsuba on character sums twisted with the divisor function.

2012-02-29math.NT

A New $k$-th Derivative Estimate for Exponential Sums via Vinogradov's Mean Value

We give a slight refinement to the process by which estimates for exponential sums are extracted from bounds for Vinogradov's mean value. Coupling this with the recent works of Wooley, and of Bourgain, Demeter and Guth, providing optimal bounds for the Vinogradov mean value, we produce a powerful new $k$-th derivative estimate. Roughly speaking, this improves the van der Corput estimate for $k\ge 4$. Various corollaries are given, showing for example that $ζ(σ+it)\ll_{\varepsilon}t^{(1-σ)^{3/2}/2+\varepsilon}$ for $t\ge 2$ and $0\leσ\le 1$, for any fixed $\varepsilon>0$.

2016-03-07math.NT

On the maximal multiplicity of long zero-sum free sequences over $C_p\oplus C_p$

In this paper, we point out that the method used in [Acta Arith. 128(2007) 245-279] can be modified slightly to obtain the following result. Let $\varepsilon \in (0,\frac 14)$ and $c>0$, and let $p$ be a sufficiently large prime depending on $\varepsilon$ and $c$. Then every zero-sumfree sequence $S$ over $C_p\oplus C_p$ of length $|S|\geq 2p-c\sqrt{p}$ contains some element at least $\lfloor p^{\frac14-\varepsilon}\rfloor$ times.

2012-11-22math.COmath.NT

更多相关论文收起更多论文

New sum product type estimates

New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising his approach to the complex plane. The bounds involving the difference set are slightly weaker. They improve on the best known ones, including the case $A\subset \R$, which also due to Solymosi, by means of combining the use of the Szemerédi-Trotter theorem with an arithmetic combinatorics technique.

2013-03-09math.COmath.NT

Sum-ratio estimates over arbitrary finite fields

The aim of this note is to record a proof that the estimate $$\max{\{|A+A|,|A:A|\}}\gg{|A|^{12/11}}$$ holds for any set $A\subset{\mathbb{F}_q}$, provided that $A$ satisfies certain conditions which state that it is not too close to being a subfield. An analogous result was established in \cite{LiORN}, with the product set $A\cdot{A}$ in the place of the ratio set $A:A$. The sum-ratio estimate here beats the sum-product estimate in \cite{LiORN} by a logarithmic factor, with slightly improved conditions for the set $A$, and the proof is arguably a little more intuitive. The sum-ratio estimate w…

2014-07-07math.COmath.NT