English
Related papers

Related papers: An improved sum-product inequality in fields of pr…

200 papers

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…

Combinatorics · Mathematics 2011-06-07 Liangpan Li , Oliver Roche-Newton

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…

Number Theory · Mathematics 2009-07-14 Liangpan Li

In this note we prove an inequality involving primes and the product of consecutive primes.

Number Theory · Mathematics 2023-05-25 Andrej Leško

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.

Number Theory · Mathematics 2007-05-23 Nets Hawk Katz , Chun-Yen Shen

In this short note, we improve the famous Reid Inequality related to linear operators.

Functional Analysis · Mathematics 2017-04-25 Mohammed Hichem Mortad

This paper improves on a sum-product estimate obtained by Katz and Shen for subsets of a finite field whose order is not prime.

Combinatorics · Mathematics 2011-01-28 Oliver Roche-Newton

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…

Number Theory · Mathematics 2007-05-23 S. V. Konyagin

We give an improved bound on the famed sum-product estimate in a field of residue class modulo $p$ ($\mathbb{F}_{p}$) by Erd\H{o}s and Szemeredi, and a non-empty set $A \subset \mathbb{F}_{p}$ such that: $$ \max \{|A+A|,|A A|\} \gg \min…

Combinatorics · Mathematics 2020-12-16 Connor Paul Wilson

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

Number Theory · Mathematics 2023-09-18 N. A. Carella

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

Combinatorics · Mathematics 2017-12-04 Brendan Murphy , Misha Rudnev , Ilya D. Shkredov , Yurii N. Shteinikov

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

Number Theory · Mathematics 2010-08-09 Anirudh Prabhu

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…

Combinatorics · Mathematics 2014-07-08 Oliver Roche-Newton

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…

Number Theory · Mathematics 2007-05-23 Nets Hawk Katz , Chun-Yen Shen

An improved estimate is given for $|\theta(x) -x|$, where $\theta(x) = \sum_{p\leq x} \log p$. Three applications are given: the first to arithmetic progressions that have points in common, the second to primes in short intervals, and the…

Number Theory · Mathematics 2014-10-20 Tim Trudgian

We prove that, if $x$ and $q\leqslant x^{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x^{1/3}$, that is congruent to $a$ modulo $q$.

Number Theory · Mathematics 2019-03-04 Olivier Ramaré , Aled Walker

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

In this note, we find a new inequality involving primes and deduce several Bonse-type inequalities.

General Mathematics · Mathematics 2009-08-21 Shaohua Zhang

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

Combinatorics · Mathematics 2018-06-20 G. Shakan , I. D. Shkredov

We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…

Number Theory · Mathematics 2011-03-09 Qizhi Zhang

Certain new inequalities for the sums of factorials are presented.

General Mathematics · Mathematics 2008-06-03 Mihaly Bencze , Florentin Smarandache
‹ Prev 1 2 3 10 Next ›