English
Related papers

Related papers: Sumfree sets in groups: a survey

200 papers

Let $S$ be a non-empty subset of a group $G$. We say $S$ is product-free if $S\cap SS=\varnothing$, and $S$ is locally maximal if whenever $T$ is product-free and $S\subseteq T$, then $S=T$. Finally $S$ fills $G$ if $G^*\subseteq S \sqcup…

Group Theory · Mathematics 2015-06-09 Chimere S. Anabanti , Sarah B. Hart

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…

Number Theory · Mathematics 2011-07-15 Geoffrey Iyer , Oleg Lazarev , Steven J. Miller , Liyang Zhang

Let $G$ be a compact abelian group and $\phi_1, \phi_2, \phi_3$ be continuous endomorphisms on $G$. Under certain natural assumptions on the $\phi_i$'s, we prove the existence of Bohr sets in the sumset $\phi_1(A) + \phi_2(A) + \phi_3(A)$,…

Combinatorics · Mathematics 2025-09-03 Anh N. Le , Thái Hoàng Lê

We show that a finite zero-sum-free sequence $\alpha$ over an abelian group has at least $c|\alpha|^{4/3}$ distinct subsequence sums, unless $\alpha$ is "controlled" by a small number of its terms; here $|\alpha|$ denotes the number of…

Number Theory · Mathematics 2022-12-21 Vsevolod F. Lev

Let $g:\mathbb{N}\to\{-1,1\}$ be a completely multiplicative function, $\mu$ be the M\"obius function and $\mu_2^2(n)$ be the indicator that $n$ is cubefree. We prove that $f=\mu^2g$ and $f=\mu_2^2g$ have unbounded partial sums. Our proofs…

Number Theory · Mathematics 2021-09-14 Marco Aymone

We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular, if $A$ and $S$ are finite, non-empty subsets of an abelian group such that $S$ is independent, and the edge boundary of $A$ with…

Combinatorics · Mathematics 2018-08-07 Vsevolod F. Lev

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In…

Combinatorics · Mathematics 2017-10-13 Asaf Ferber , Gweneth Anne McKinley , Wojciech Samotij

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The Kemperman Structure Theorem characterizes all subsets $A,\,B\subseteq G$ satisfying…

Number Theory · Mathematics 2018-04-20 David J. Grynkiewicz

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

Let $A = \{a_1, \ldots, a_k\}$ be a nonempty finite subset of an additive abelian group $G$. For a nonnegative integer $h$, the \emph{$h$-fold signed sumset} of $A$, denoted by $h_{\pm} A$, is defined by $$ h_{\pm} A = \Biggl\{\sum_{i =…

Combinatorics · Mathematics 2026-05-06 Raj Kumar Mistri , Nitesh Prajapati

Erd\H{o}s first showed that the number of positive integers up to $x$ which can be written as a product of two number less than $\sqrt{x}$ has zero density. Ford then found the correct order of growth of the set of all these integers. We…

Number Theory · Mathematics 2018-05-08 Patrick Meisner

A set $S\subset \mathbb{N}$ is a Sidon set if all pairwise sums $s_1+s_2$ (for $s_1, s_2\in S$, $s_1\leq s_2$) are distinct. A set $S\subset \mathbb{N}$ is an asymptotic basis of order 3 if every sufficiently large integer $n$ can be…

Number Theory · Mathematics 2024-05-14 Cédric Pilatte

We determine the largest subset $A\subseteq \{1,\dotsc,n\}$ such that for all $a,b\in A$, the product $ab$ is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers. This resolves a…

Combinatorics · Mathematics 2025-07-04 Boris Alexeev , Dustin G. Mixon , Will Sawin

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

Combinatorics · Mathematics 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

Let $G$ be a finite group and $S$ a subset of $G$. Then $S$ is product-free if $S \cap SS = \emptyset$, and complete if $G^{\ast} \subseteq S \cup SS$. A product-free set is locally maximal if it is not contained in a strictly larger…

Combinatorics · Mathematics 2016-10-03 Chimere S. Anabanti , Grahame Erskine , Sarah B. Hart

For an interval [1,N] in the natural numbers, investigating subsets S of [1,N] such that |{(x,y) in S^2:x+y in S}|=0, known as sum-free sets, has attracted considerable attention. In this paper, we define r(S):=|{(x,y) in S^2: x+y in S}|…

Combinatorics · Mathematics 2011-06-20 Sophie Huczynska

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

Combinatorics · Mathematics 2015-10-26 Yufei Zhao

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

Number Theory · Mathematics 2018-11-12 Sávio Ribas

A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\H{o}s characterised the largest families of subsets of…

Combinatorics · Mathematics 2017-08-09 Wojciech Samotij