English
Related papers

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

200 papers

In 1966, Kleitman determined the maximum size of a family of subsets of $[n]$ with bounded symmetric difference. Liao, Liu and Yan recently established a vector-space analogue in the cases $n=d+1$ and $n>2d$, and asked for the sharp bound…

Combinatorics · Mathematics 2026-05-20 Chenhui Lv , Zixiang Xu

We prove that |A^n| > c_n |A|^{[\frac{n+1}{2}]} for any finite subset A of a free group if A contains at least two noncommuting elements, where c_n>0 are constants not depending on A. Simple examples show that the order of these estimates…

Group Theory · Mathematics 2015-05-18 Stanislav Safin

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

General Topology · Mathematics 2024-12-30 Denis I. Saveliev

Let $G$ be an abelian group. A tri-colored sum-free set in $G^n$ is a collection of triples $({\bf a}_i, {\bf b}_i, {\bf c}_i)$ in $G^n$ such that ${\bf a}_i+{\bf b}_j+{\bf c}_k=0$ if and only if $i=j=k$. Fix a prime $q$ and let $C_q$ be…

Combinatorics · Mathematics 2018-07-09 Robert Kleinberg , Will Sawin , David E. Speyer

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Number Theory · Mathematics 2026-03-24 Simone Costa , Stefano Della Fiore , Mattia Fontana , Lluís Vena

Given a finite subset A of an abelian group G, we study the set k \wedge A of all sums of k distinct elements of A. In this paper, we prove that |k \wedge A| >= |A| for all k in {2,...,|A|-2}, unless k is in {2,|A|-2} and A is a coset of an…

Combinatorics · Mathematics 2012-06-27 Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

Continuing on from recent results of Brumer-Kramer and of Schoof, we show that there exist non-zero semistable Abelian varieties over Z[1/N], with N squarefree, if and only if N is not in the set {1,2,3,5,6,7,10,13}. Our results are…

Number Theory · Mathematics 2007-05-23 Frank Calegari

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…

Number Theory · Mathematics 2008-12-16 Vsevolod F. Lev , Mikhail E. Muzychuk , Rom Pinchasi

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. In this paper we consider the following three general questions: (i) What is the size…

Combinatorics · Mathematics 2016-10-20 Robert Hancock , Andrew Treglown

For a positive integer $n$, let $[n]$ denote $\{1, \ldots, n\}$. For a 2-dimensional integer lattice point $\mathbf{b}$ and positive integers $k\geq 2$ and $n$, a \textit{$k$-sum $\mathbf{b}$-free set} of $[n]\times [n]$ is a subset $S$ of…

Combinatorics · Mathematics 2019-03-13 Ilkyoo Choi , Ringi Kim , Boram Park

In 1927, Artin conjectured that any integer other than -1 or a perfect square generates the multiplicative group $\mathbb{Z}/p\mathbb{Z}^\times$ for infinitely many $p$. In \cite{MoSt}, Moree and Stevenhagen considered a two-variable…

Number Theory · Mathematics 2017-11-20 M. Ram Murty , François Séguin , Cameron L. Stewart

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz

Our main result, Theorem 2.5, shows the existence of a vast infinity of subset sum problems solvable in polynomial time. The only proof we have of this result uses the ZFC independent Jump Free Theorem of Harvey Friedman, thus putting…

Combinatorics · Mathematics 2021-11-01 S. Gill Williamson

Let $G$ be a finite additive abelian group with exponent $n>1$, and let $a_1,\ldots,a_{n-1}\in G$. We show that there is a permutation $\sigma\in S_{n-1}$ such that all the elements $sa_{\sigma(s)}\ (s=1,\ldots,n-1)$ are nonzero if and only…

Number Theory · Mathematics 2017-12-12 Fan Ge , Zhi-Wei Sun

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

Number Theory · Mathematics 2013-05-14 Yahya ould Hamidoune , Susana C. Lopez , Alain Plagne

We study the existence of free subalgebras in division algebras, and prove the following general result: if $A$ is a noetherian domain which is countably generated over an uncountable algebraically closed field $k$ of characteristic 0, then…

Rings and Algebras · Mathematics 2013-07-03 Jason P. Bell , D. Rogalski

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 present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in $[0,\frac{1}{3}]$, answering a question of Cameron, and that the number of those…

Combinatorics · Mathematics 2017-05-02 Ishay Haviv , Dan Levy

Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the maximum size of $A\subset G^{N}$ such that the difference set $A-A$ and $J^{N}$ have no non-trivial intersection. Recently, this extremal…

Combinatorics · Mathematics 2026-01-06 Zixiang Xu , Chi Hoi Yip

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