English
Related papers

Related papers: Iterated Sumsets and Setpartitions

200 papers

For a finite group $G,$ $\mathsf{D}(G)$ is defined as the least positive integer $k$ such that for every sequence $S=g_1\bdot g_2\bdot \dotsc \bdot g_k$ of length $k$ over $G$, there exist $1 \le i_1 < i_2 <\cdots < i_m \le k $ such that…

Combinatorics · Mathematics 2025-11-25 Naveen K. Godara , Renu Joshi , Eshita Mazumdar

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

The main objectives of this paper are to give general proofs of the following two facts: A. For an operad $\oo$ in $\ab$, let $A$ be a simplicial $\oo$-algebra such that $A_m$ is the $\oo$-subalgebra generated by $(\sum_{i = 0}^{m}…

K-Theory and Homology · Mathematics 2007-05-23 J. L. Castiglioni , M. Ladra

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Logic · Mathematics 2011-05-17 Ehud Hrushovski

Let P=(p_1,p_2,...,p_N) be a sequence of points in the plane, where p_i=(x_i,y_i) and x_1<x_2<...<x_N. A famous 1935 Erdos--Szekeres theorem asserts that every such P contains a monotone subsequence S of $\sqrt N$ points. Another, equally…

Computational Geometry · Computer Science 2012-03-23 Marek Elias , Jiri Matousek

For a finite abelian group $G$ and positive integers $m$ and $h$, we let $$\rho(G, m, h) = \min \{|hA| \; : \; A \subseteq G, |A|=m\}$$ and $$\rho_{\pm} (G, m, h) = \min \{|h_{\pm} A| \; : \; A \subseteq G, |A|=m\},$$ where $hA$ and…

Number Theory · Mathematics 2014-12-05 Bela Bajnok , Ryan Matzke

In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…

Combinatorics · Mathematics 2024-08-06 Arman Ataei Kachouei , Farhad Rahmati

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

Number Theory · Mathematics 2022-11-28 Bela Bajnok , Connor Berson , Hoang Anh Just

Jin proved that whenever $A$ and $B$ are sets of positive upper density in $\Z$, $A+B$ is piecewise syndetic. Jin's theorem was subsequently generalized by Jin and Keisler to a certain family of abelian groups, which in particular contains…

Dynamical Systems · Mathematics 2009-05-15 Mathias Beiglboeck , Vitaly Bergelson , Alexander Fish

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

Combinatorics · Mathematics 2020-04-24 Simone Costa , Marco Antonio Pellegrini

We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…

Data Structures and Algorithms · Computer Science 2025-02-12 Pascal Koiran

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length of such a zero-sum free sequence is 2n-2,…

Combinatorics · Mathematics 2010-05-26 Gautami Bhowmik , Immanuel Halupczok , Jan-Christoph Schlage-Puchta

Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in…

Number Theory · Mathematics 2016-07-20 Béla Bajnok , Samuel Edwards

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…

Let $G$ be a finite abelian group. Let $g(G)$ be the smallest positive integer $t$ such that every subset of cardinality $t$ of the group $G$ contains a subset of cardinality $\mathrm{exp}(G)$ whose sum is zero. In this paper, we show that…

Number Theory · Mathematics 2020-05-26 Srilakshmi Krishnamoorthy , Karthikesh , Umesh Shankar

An old conjecture of Graham stated that if $n$ is a prime and $S$ is a sequence of $n$ terms from the cyclic group $C_n$ such that all (nontrivial) zero-sum subsequences have the same length, then $S$ must contain at most two distinct…

Combinatorics · Mathematics 2009-03-19 David J. Grynkiewicz

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

Number Theory · Mathematics 2014-01-31 Li-meng Xia

We study the connection between the Baum-Connes conjecture for an ample groupoid $G$ with coefficient $A$ and the K\"unneth formula for the K-theory of tensor products by the crossed product $A\rtimes_r G$. To do so we develop the machinery…

Operator Algebras · Mathematics 2020-07-30 Christian Bönicke , Clément Dell'Aiera

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

Combinatorics · Mathematics 2014-07-29 Papa A. Sissokho

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

Combinatorics · Mathematics 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz