English
Related papers

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

200 papers

A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most $(1+o(1))\binom{n}{n/2}$.…

Combinatorics · Mathematics 2016-01-15 Jozsef Balogh , Adam Zsolt Wagner

$\aleph_1$-free groups, abelian groups for which every countable subgroup is free, exhibit a number of interesting algebraic and set-theoretic properties. In this paper, we give a complete proof that the property of being $\aleph_1$-free is…

Group Theory · Mathematics 2021-04-22 Daniel Herden , Alexandra V. Pasi

A subset $X$ of an abelian $G$ is said to be {\em complete} if every element of the subgroup generated by $X$ can be expressed as a nonempty sum of distinct elements from $X$. Let $A\subset \Z_n$ be such that all the elements of $A$ are…

Number Theory · Mathematics 2007-05-23 Y. O. Hamidoune , A. S. Lladó , O. Serra

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

Combinatorics · Mathematics 2025-04-15 Dingyuan Liu , Letícia Mattos , Tibor Szabó

The Minkowski sum of two subsets $A$ and $B$ of a finite abelian group $G$ is defined as all pairwise sums of elements of $A$ and $B$: $A + B = \{ a + b : a \in A, b \in B \}$. The largest size of a $(k, \ell)$-sum-free set in $G$ has been…

Combinatorics · Mathematics 2020-09-15 Rachel Zhang

We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a…

Combinatorics · Mathematics 2014-02-05 Ben Green , Robert Morris

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

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz , Karol Suchan

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

Let p be a prime. We prove that if a finite group G has non-abelian Sylow p-subgroups, and the class size of every p-element in G is coprime to p; then G contains a simple group as a subquotient which exhibits the same property. In addition…

Group Theory · Mathematics 2016-11-25 Julian Brough

For an additive group $\Gamma$ the sequence $S = (g_1, \ldots, g_t)$ of elements of $\Gamma$ is a zero-sum sequence if $g_1 + \cdots + g_t = 0_\Gamma$. The cross number of $S$ is defined to be the sum $\sum_{i=1}^k 1/|g_i|$, where $|g_i|$…

Combinatorics · Mathematics 2024-05-29 Neal Bushaw , Glenn Hurlbert

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

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…

Combinatorics · Mathematics 2018-05-15 Alain Plagne , Salvatore Tringali

Let $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\choose m+1}+\ldots +{n\choose 2m+1}$ if $n=3m+1$. Confirming the conjecture…

Combinatorics · Mathematics 2017-11-30 Peter Frankl , Andrey Kupavskii

We construct a non-free but aleph_1-separable, torsion-free abelian group G with a pure free subgroup B such that all subgroups of G disjoint from B are free and such that G/B is divisible. This answers a question of Irwin and shows that a…

Logic · Mathematics 2007-11-21 Andreas Blass , Saharon Shelah

In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…

Computational Complexity · Computer Science 2013-05-01 Sixia Chen , Cristopher Moore , Alexander Russell

Let $G\cong C_{n_1}\oplus ... \oplus C_{n_r}$ be a finite and nontrivial abelian group with $n_1|n_2|...|n_r$. A conjecture of Hamidoune says that if $W=w_1... w_n$ is a sequence of integers, all but at most one relatively prime to $|G|$,…

Number Theory · Mathematics 2008-06-03 D. J. Grynkiewicz , E. Marchan , O. Ordaz

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

In this article, we study the maximal cross number of long zero-sumfree sequences in a finite Abelian group. Regarding this inverse-type problem, we formulate a general conjecture and prove, among other results, that this conjecture holds…

Number Theory · Mathematics 2010-10-19 Benjamin Girard

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

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

Combinatorics · Mathematics 2022-04-12 Maximus Redman , Lauren Rose , Raphael Walker