English
Related papers

Related papers: New results on sum-products in R

200 papers

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Number Theory · Mathematics 2017-10-24 Kummari Mallesham

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

Number Theory · Mathematics 2010-04-02 Tom Sanders

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…

Number Theory · Mathematics 2017-03-08 Jitender Singh

We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…

Combinatorics · Mathematics 2018-12-27 Matthew Hase-Liu , Adam Sheffer

Improving upon a technique of Croot and Hart, we show that for every $h$, there exists an $\epsilon > 0$ such that if $A \subseteq \mathbb{R}$ is sufficiently large and $|A.A| \le |A|^{1+\epsilon}$, then $|hA| \ge…

Combinatorics · Mathematics 2014-10-21 Albert Bush , Ernie Croot

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

Combinatorics · Mathematics 2016-03-22 Kevin Topley

Bourgain, Konyagin and Shparlinski obtained a lower bound for the size of the product set AB when A and B are sets of positive rational numbers with numerator and denominator less or equal than Q. We extend and slightly improve that lower…

Number Theory · Mathematics 2016-11-25 Javier Cilleruelo

Let $F$ be a field with positive odd characteristic $p$. We prove a variety of new sum-product type estimates over $F$. They are derived from the theorem that the number of incidences between $m$ points and $n$ planes in the projective…

Combinatorics · Mathematics 2016-09-06 Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Combinatorics · Mathematics 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

Let $A,B$ be nonempty subsets of a an abelian group $G$. Let $N_i(A,B)$ denote the set of elements of $G$ having $i$ distinct decompositions as a product of an element of $A$ and an element of $B$. We prove that $$ \sum _{1\le i \le t} |N_i…

Number Theory · Mathematics 2008-04-17 Y. O. Hamidoune , O. Serra

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 $$…

Number Theory · Mathematics 2015-07-21 Dmitrii Zhelezov

Let $A$ be a finite set of positive real numbers. We present a sum-division estimate: |A+A|^2|A/A|\geq\frac{|A|^4}{4}.

Number Theory · Mathematics 2009-05-16 Liangpan Li , Jian Shen

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Computational Geometry · Computer Science 2007-05-23 Qi Cheng

We obtain general criteria for giving a lower bound on the degree of numbers of the form $\prod_{n=1}^\infty \left(1+\frac{b_n}{\alpha_n}\right)$ or of the form $\prod_{m=1}^\infty \left(1+ \sum_{n=1}^\infty…

Number Theory · Mathematics 2025-02-06 Simon Kristensen , Mathias Løkkegaard Laursen

In recent years, maximizing G\'al sums regained interest due to a firm link with large values of $L$-functions. In the present paper, we initiate an investigation of small sums of G\'al type, with respect to the $L^1$-norm. We also consider…

Number Theory · Mathematics 2020-07-13 Régis de la Bretèche , Marc Munsch , Gérald Tenenbaum

We generalize and solve the $\roman{mod}\,q$ analogue of a problem of Littlewood and Offord, raised by Vaughan and Wooley, concerning the distribution of the $2^n$ sums of the form $\sum_{i=1}^n\varepsilon_ia_i$, where each $\varepsilon_i$…

Number Theory · Mathematics 2016-09-06 Jerrold R. Griggs
‹ Prev 1 4 5 6 7 8 10 Next ›