English
Related papers

Related papers: On maximal sum-free sets in abelian groups

200 papers

A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…

Number Theory · Mathematics 2025-02-13 Benjamin Bedert

Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…

Combinatorics · Mathematics 2024-12-24 Pierre-Yves Bienvenu , Benjamin Girard , Thái Hoàng Lê

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

Combinatorics · Mathematics 2013-05-15 Amela Muratovic-Ribic , Qiang Wang

The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…

Number Theory · Mathematics 2021-08-10 Arindam Biswas , Jyoti Prakash Saha

For a finite multiset $A$ of an abelian group $G$, let $\text{FS}(A)$ denote the multiset of the $2^{|A|}$ subset sums of $A$. It is natural to ask to what extent $A$ can be reconstructed from $\text{FS}(A)$. We fully solve this problem for…

Combinatorics · Mathematics 2024-12-10 Federico Glaudo , Noah Kravitz

In 1990, Alon and Kleitman proposed an argument for the sum-free subset problem: every set of n nonzero elements of a finite Abelian group contains a sum-free subset A of size |A|>\frac{2}{7}n. In this note, we show that the argument…

Combinatorics · Mathematics 2017-05-16 Zhengjun Cao , Lihua Liu

Let $G$ be an additive abelian group and $S\subset G$ a subset. Let $\Sigma(S)$ denote the set of group elements which can be expressed as a sum of a nonempty subset of $S$. We say $S$ is zero-sum free if $0 \not\in \Sigma(S)$. It was…

Combinatorics · Mathematics 2018-01-03 Jiangtao Peng , Wanzhen Hui

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

We prove that product-free sets of the free group over a finite alphabet have maximum density $1/2$ with respect to the natural measure that assigns total weight one to each set of irreducible words of a given size. This confirms a…

Combinatorics · Mathematics 2024-09-12 Miquel Ortega , Juanjo Rué , Oriol Serra

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

Group Theory · Mathematics 2015-12-18 Sarah Hart , Chimere Anabanti

A subgroup of a finite group G is said to be second maximal if it is maximal in every maximal subgroup of G that contains it. A question which has received considerable attention asks: can every positive integer occur as the number of the…

Group Theory · Mathematics 2008-10-22 Alberto Basile

Let D be an infinite division ring, n a natural number and N a subnormal subgroup of GLn(D) such that n = 1 or the center of D contains at least five elements. This paper contains two main results. In the first one we prove that each…

Rings and Algebras · Mathematics 2013-07-23 M. Ramezan-Nassab , D. Kiani

A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).

Number Theory · Mathematics 2007-05-23 Ben Green

We find the nonabelian finite simple groups with order prime divisors not exceeding 1000. More generally, we determine the sets of nonabelian finite simple groups whose maximal order prime divisor is a fixed prime less than 1000. Our…

Group Theory · Mathematics 2012-02-16 Andrei V. Zavarnitsine

A finite set $A$ of integers is square-sum-free if there is no subset of $A$ sums up to a square. In 1986, Erd\H os posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1, ..., n \}$. Answering this…

Combinatorics · Mathematics 2009-10-30 Hoi Nguyen , Van Vu

We describe the two-generated limits of abelian-by-(infinite cyclic) groups in the space of marked groups using number theoretic methods. We also discuss universal equivalence of these limits.

Group Theory · Mathematics 2010-07-09 Luc Guyot

We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…

Logic · Mathematics 2013-11-11 Kyle Riggs

We call a subset $A$ of the (additive) abelian group $G$ {\it $t$-independent} if for all non-negative integers $h$ and $k$ with $h+k \leq t$, the sum of $h$ (not necessarily distinct) elements of $A$ does not equal the sum of $k$ (not…

Number Theory · Mathematics 2015-12-10 Béla Bajnok , Imre Ruzsa

A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the…

Combinatorics · Mathematics 2025-09-30 Bence Csajbók , Zoltán Lóránt Nagy

We give a simple proof of the finite presentation of Sela's limit groups by using free actions on $\bbR^n$-trees. We first prove that Sela's limit groups do have a free action on an $\bbR^n$-tree. We then prove that a finitely generated…

Digital Libraries · Computer Science 2007-05-23 Vincent Guirardel