English
Related papers

Related papers: A note on the largest sum-free sets of integers

200 papers

Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…

Combinatorics · Mathematics 2018-12-24 Keith J. Edwards , Steven D. Noble

We introduce the concepts of max-closedness and numeraires of convex subsets in the nonnegative orthant of the topological vector space of all random variables built over a probability space, equipped with a topology consistent with…

Functional Analysis · Mathematics 2014-10-06 Constantinos Kardaras

Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

Let $A$ be a finite subset of $\mathbb{Z}^n$, which generates $\mathbb{Z}^n$ additively. We provide a precise description of the $N$-fold sumsets $NA$ for $N$ sufficiently large, with some explicit bounds on "sufficiently large."

Number Theory · Mathematics 2020-04-28 Andrew Granville , George Shakan

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$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Number Theory · Mathematics 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…

Combinatorics · Mathematics 2024-01-17 Oliver Roche-Newton , Elaine Wong

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Number Theory · Mathematics 2024-02-26 David J. Grynkiewicz

Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…

Probability · Mathematics 2012-04-09 Kevin McGoff

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

Combinatorics · Mathematics 2024-12-31 Shoichi Kamada

A set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

Combinatorics · Mathematics 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that…

Number Theory · Mathematics 2019-12-24 Alain Faisant , Georges Grekos , Ram Krishna Pandey , Sai Teja Somu

It is established that there exists an absolute constant $c>0$ such that for any finite set $A$ of positive real numbers $$|AA+A| \gg |A|^{\frac{3}{2}+c}.$$ On the other hand, we give an explicit construction of a finite set $A \subset…

Combinatorics · Mathematics 2018-10-03 Oliver Roche-Newton , Imre Z. Ruzsa , Chun-Yen Shen , Ilya D. Shkredov

We determine the shape of all sum-free sets in $\{1,2,\ldots,n\}^2$ of size close to the maximum $\frac{3}{5}n^2$, solving a problem of Elsholtz and Rackham. We show that all such asymptotic maximum sum-free sets lie completely in the…

Combinatorics · Mathematics 2022-08-19 Hong Liu , Guanghui Wang , Laurence Wilkes , Donglei Yang

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

Number Theory · Mathematics 2020-12-29 Aliaksei Semchankau , Dmitry Shabanov , Ilya Shkredov

We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

The well-known $abc$-conjecture concerns triples $(a,b,c)$ of non-zero integers that are coprime and satisfy ${a+b+c=0}$. The strong $n$-conjecture is a generalisation to $n$ summands where integer solutions of the equation ${a_1 + \ldots +…

Number Theory · Mathematics 2025-07-17 Rupert Hölzl , Sören Kleine , Frank Stephan

Given a subset $A$ of the $n$-dimensional Boolean hypercube $\mathbb{F}_2^n$, the sumset $A+A$ is the set $\{a+a': a, a' \in A\}$ where addition is in $\mathbb{F}_2^n$. Sumsets play an important role in additive combinatorics, where they…

Data Structures and Algorithms · Computer Science 2021-07-27 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

In this paper we prove that if $A$ and $B$ are infinite subsets of positive integers such that every positive integer $n$ can be written as $n=ab$, $a\in A$, $b\in B$, then $\displaystyle \lim_{x\to \infty}\frac{A(x)B(x)}{x}=\infty $. We…

Number Theory · Mathematics 2023-05-08 Anett Kocsis , Dávid Matolcsi , Csaba Sándor , György Tőtős

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

Number Theory · Mathematics 2026-05-12 Christian Bernert , Tim Browning , Jared Duker Lichtman , Joni Teräväinen