English
Related papers

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

200 papers

In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two…

Group Theory · Mathematics 2026-02-03 Artūras Dubickas , Chris Smyth

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

Group Theory · Mathematics 2017-05-17 Mark Shusterman

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

Combinatorics · Mathematics 2010-10-26 Michael E. Picollelli

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

Group Theory · Mathematics 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Number Theory · Mathematics 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of $[1,n]$ with lowest value in $\left [\frac{n}{3},\frac{n}{2}\right ]$, and the identification of…

Combinatorics · Mathematics 2023-10-05 Renato Cordeiro de Amorim

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

Group Theory · Mathematics 2024-05-08 Mihai-Silviu Lazorec

The problem of computing the optimum of a function on a finite set is an important problem in mathematics and computer science. Many combinatorial problems such as MAX-SAT and MAXCUT can be recognized as optimization problems on the…

Optimization and Control · Mathematics 2023-02-07 Jiangting Yang , Ke Ye , Lihong Zhi

We give upper bounds for triples of subsets of a finite group such that the triples of elements that multiply to 1 form a perfect matching. Our bounds are the first to give exponential savings in powers of an arbitrary finite group.…

Combinatorics · Mathematics 2017-02-06 Will Sawin

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 a sequence $S$ over a finite abelian group, let $MZ(S)$ denote the length of the shortest nonempty zero-sum subsequence of $S$. We prove that if $G$ is finite abelian of order $n$ and $S$ has length $n$, then $MZ(S)\le n-|\supp(S)|+1$.…

Number Theory · Mathematics 2026-05-29 Claudiu Pop , George C. Ţurcaş

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this…

Group Theory · Mathematics 2025-07-08 Prashun Kumar , Geetha Venkataraman

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes…

Number Theory · Mathematics 2007-05-23 R. Balasubramanian , Gyan Prakash

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

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.

Group Theory · Mathematics 2014-12-02 Azer Akhmedov , Damiano Fulghesu

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Group Theory · Mathematics 2017-05-01 Marius Tărnăuceanu , László Tóth

Building on the classification of modules for algebraic groups with finitely many orbits on subspaces, we determine all faithful irreducible modules for simple and maximal-semisimple connected algebraic groups that are orthogonal and have…

Group Theory · Mathematics 2019-07-17 Aluna Rizzoli

Generalising the Cameron--Erd\H{o}s conjecture to two dimensions, Elsholtz and Rackham conjectured that the number of sum-free subsets of $[n]^2$ is $2^{0.6n^2+O(n)}$. We prove their conjecture.

Combinatorics · Mathematics 2025-10-20 Anubhab Ghosal
‹ Prev 1 4 5 6 7 8 10 Next ›