English
Related papers

Related papers: On the size of $k$-fold sum and product sets of in…

200 papers

The Kahane--Salem--Zygmund inequality for multilinear forms in $\ell_{\infty}$ spaces claims that, for all positive integers $m,n_{1},...,n_{m}$, there exists an $m$-linear form $A\colon\ell_{\infty}^{n_{1}}\times\cdots\times…

Combinatorics · Mathematics 2021-11-04 Daniel Pellegrino , Anselmo Raposo

We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a…

Number Theory · Mathematics 2015-06-26 Peter Hegarty

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

Number Theory · Mathematics 2024-04-02 Siddharth Iyer

Euler sums (also called Zagier sums) occur within the context of knot theory and quantum field theory. There are various conjectures related to these sums whose incompletion is a sign that both the mathematics and physics communities do not…

High Energy Physics - Theory · Physics 2007-05-23 J. M. Borwein , D. M. Bradley , D. J. Broadhurst

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

Zaremba's conjecture (1971) states that every positive integer number d can be represented as a denominator of a finite continued fraction b/d = [d1,d2,...,dk], with all partial quotients d1,d2,...,dk being bounded by an absolute constant…

Number Theory · Mathematics 2017-03-08 I. D. Kan

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Number Theory · Mathematics 2022-01-27 Yong-Gao Chen , Yuchen Ding

Let $A$ be a finite set of $k$ integers. For $h \leq k$, the restricted $h$-fold sumset $h^{\wedge} A$ is the set of all sums of $h$ distinct elements of $A$. In additive combinatorics, much of the focus has traditionally been on finite…

Combinatorics · Mathematics 2025-05-13 Debyani Manna , Mohan , Ram Krishna Pandey

Let A \subseteq [1,..,N]^2 be a set of cardinality at least N^2/(log log N)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d>0. This theorem is a two-dimensional generalization of…

Number Theory · Mathematics 2007-05-23 I. D. Shkredov

Revisiting a $50$-year-old estimate of Choi, Erd\H{o}s and Szemer\'edi, we show that if $A \subseteq \{1, 2, \ldots, 2n\}$ satisfies $|A| \ge n + 1.2 \cdot 10^8$, then there exist five distinct integers whose pairwise sums are all contained…

Number Theory · Mathematics 2026-05-04 Wouter van Doorn

We show that there exists an absolute constant $c > 0$, such that, for any finite set $A$ of quaternions, \[ \max\{|A+A, |AA| \} \gtrsim |A|^{4/3 + c}. \] This generalizes a sum-product bound for real numbers proved by Konyagin and…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Ben Lund

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

Number Theory · Mathematics 2013-01-17 Marina Nincevic , Sinisa Slijepcevic

We obtain a bounded generation theorem over $\mathcal O/\mathfrak a$, where $\mathcal O$ is the ring of integers of a number field and $\mathfrak a$ a general ideal of $\mathcal O$. This addresses a conjecture of Salehi-Golsefidy. Along the…

Number Theory · Mathematics 2024-12-10 Jincheng Tang , Xin Zhang

Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$.

Number Theory · Mathematics 2019-04-15 Francois Hennecart , Gyan Prakash , E. Pramod

Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…

Number Theory · Mathematics 2012-07-31 Ping Xi

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2017-07-31 Angel Kumchev , Huafeng Liu

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

Number Theory · Mathematics 2015-04-01 Francesco Monopoli

A $k$-sum of a set $A\subseteq \mathbb{Z}$ is an integer that may be expressed as a sum of $k$ distinct elements of $A$. How large can the ratio of the number of $(k+1)$-sums to the number of $k$-sums be? Writing $k\wedge A$ for the set of…

Number Theory · Mathematics 2012-06-11 Simon Griffiths

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

Information Theory · Computer Science 2015-10-05 Trygve Johnsen , Keisuke Shiromoto , Hugues Verdure