English
Related papers

Related papers: Counting MSTD Sets in Finite Abelian Groups

200 papers

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

Combinatorics · Mathematics 2014-07-01 Eric Balandraud , Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

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 investigate the relationship between the sizes of the sum and difference sets of the Dicyclic Group $\mathrm{Dic}_{4n}$. We first determine the exact numbers of MSTD (more sums than differences), MDTS (more differences than sums), and…

General Mathematics · Mathematics 2026-02-11 Sagar Mandal , Neetu

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

For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…

Combinatorics · Mathematics 2025-09-30 Shuxing Li , Chi Hoi Yip

Given a finite set $A\subset \mathbb{R}\backslash \{0\}$, define \begin{align*}&A\cdot A \ =\ \{a_i\cdot a_j\,|\, a_i,a_j\in A\},\\ &A/A \ =\ \{a_i/a_j\,|\,a_i,a_j\in A\},\\ &A + A \ =\ \{a_i + a_j\,|\, a_i,a_j\in A\},\\ &A - A \ =\ \{a_i -…

Number Theory · Mathematics 2020-01-16 Hung Viet Chu

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

Combinatorics · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

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

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

Number Theory · Mathematics 2019-10-23 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…

Number Theory · Mathematics 2010-09-15 Steven J. Miller , Brooke Orosz , Daniel Scheinerman

We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…

Combinatorics · Mathematics 2024-02-15 Mohsen Aliabadi , Shira Zerbib

In this paper, we classify all finite groups $G$ which have the following property: for all subsets $A \subseteq G$, we have $|AA^{-1}| = |A^{-1}A|$. This question is motivated by the problem in additive combinatorics of More Sums Than…

Group Theory · Mathematics 2025-10-21 Haran Mouli , Pramana Saldin

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

Number Theory · Mathematics 2017-12-27 Raj Kumar Mistri , R. Thangadurai

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

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

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

Commutative Algebra · Mathematics 2024-04-29 Alfred Geroldinger , Florian Kainrath

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

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

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…

Group Theory · Mathematics 2015-06-05 Daniel Miller

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst