English
Related papers

Related papers: A Note on the Alon-Kleitman Argument for Sum-free …

200 papers

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…

Combinatorics · Mathematics 2026-05-27 Nathanaël Hassler , Andrew Treglown

A subset $D$ of an Abelian group is $decomposable$ if $\emptyset\ne D\subset D+D$. In the paper we give partial answer to an open problem asking whether every finite decomposable subset $D$ of an Abelian group contains a non-empty subset…

Group Theory · Mathematics 2019-05-03 Taras Banakh , Alex Ravsky

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

Combinatorics · Mathematics 2020-04-24 Simone Costa , Marco Antonio Pellegrini

Tarnauceanu [Archiv der Mathematik, 102 (1), (2014), 11--14] gave a characterisation of elementary abelian $2$-groups in terms of their maximal sum-free sets. His theorem states that a finite group $G$ is an elementary abelian $2$-group if…

Combinatorics · Mathematics 2016-11-22 Chimere Anabanti

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Combinatorics · Mathematics 2019-12-03 Patrick Bennett

Given an Abelian groups $G$, denote $\mu(G)$ the size of its largest sum-free subset and $f_{\max}(G)$ the number of maximal sum-free sets in $G$. Confirming a prediction by Liu and Sharifzadeh, we prove that all even-order $G\ne…

Combinatorics · Mathematics 2026-03-02 József Balogh , Ramon I. Garcia , Hong Liu , Ningyuan Yang

The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

Combinatorics · Mathematics 2023-06-22 Sylwia Cichacz , Karol Suchan

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

Number Theory · Mathematics 2016-06-03 R. Balasubramanian , Gyan Prakash , D. S. Ramana

We count the ordered sum-free triplets of subsets in the group $\mathbb{Z}/p\mathbb{Z}$, i.e., the triplets $(A,B,C)$ of sets $A,B,C \subset \mathbb{Z}/p\mathbb{Z}$ for which the equation $a+b=c$ has no solution with $a\in A$, $b \in B$ and…

Combinatorics · Mathematics 2021-08-20 Igor Araujo , József Balogh , Ramon I. Garcia

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

Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of $\{1, \dots, n\}$, thereby answering a question of Cameron and Erd\H{o}s. In…

Combinatorics · Mathematics 2022-04-29 Nathanaël Hassler , Andrew Treglown

We show that, in contrast to the integers setting, almost all even order abelian groups $G$ have exponentially fewer maximal sum-free sets than $2^{\mu(G)/2}$, where $\mu(G)$ denotes the size of a largest sum-free set in $G$. This confirms…

Combinatorics · Mathematics 2018-11-15 Hong Liu , Maryam Sharifzadeh

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

Number Theory · Mathematics 2011-10-18 Benjamin Girard

We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp threshold for the following property: the largest such set is contained in some maximum-size sum-free subset of the group.…

Combinatorics · Mathematics 2015-06-03 Neal Bushaw , Maurício Collares Neto , Robert Morris , Paul Smith

Let $A \subset \mathbb{Z}_{>0}$ of size $n$. It is conjectured that for any $C >0$ and $n$ large enough that $A$ contains a sum-free subset of size at least $n/3 +C$. We study this problem and find an alternate proof of Bourgain's result…

Number Theory · Mathematics 2022-07-29 George Shakan

Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…

Number Theory · Mathematics 2013-08-13 Xingwu Xia , Weidong Gao

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such…

Combinatorics · Mathematics 2014-02-26 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

Let $G$ be a finite abelian group, and let $S$ be a sequence over $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we determine all the sequences $S$…

Number Theory · Mathematics 2009-09-14 Pingzhi Yuan

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv