English
Related papers

Related papers: Thresholds for zero-sums with small cross numbers …

200 papers

Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of…

Combinatorics · Mathematics 2012-11-20 Liliana Alcón , Marisa Gutierrez , Glenn Hurlbert

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 be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with…

Combinatorics · Mathematics 2011-12-02 Sukumar Das Adhikari , David J. Grynkiewicz , Zhi-Wei Sun

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

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than 1 to exactly one vertex of $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code…

Combinatorics · Mathematics 2025-07-22 Huye chen , Binbin Li , Jingjian Li , Hao Yu

The Cayley sum graph $\Gamma_A$ of a set $A \subseteq \mathbb{Z}_n$ is defined to have vertex set $\mathbb{Z}_n$ and an edge between two distinct vertices $x, y \in \mathbb{Z}_n$ if $x + y \in A$. Green and Morris proved that if the set $A$…

Combinatorics · Mathematics 2024-12-05 Marcelo Campos , Gabriel Dahia , João Pedro Marciano

In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In this work, we extend their result, establishing similar bounds…

Combinatorics · Mathematics 2025-02-13 Yuval Filmus , Hamed Hatami , Kaave Hosseini , Esty Kelman

Let $A=\{a_1,a_2,\dots, a_m\}$ be a subset of a finite abelian group $G$. We call $A$ {\it $t$-independent} in $G$, if whenever $$\lambda_1a_1+\lambda_2a_2+\cdots +\lambda_m a_m=0$$ for some integers $\lambda_1, \lambda_2, \dots ,…

Number Theory · Mathematics 2024-06-07 Bela Bajnok

Let $G$ be a finite abelian group, and let $S$ be a sequence over $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we determine all the sequences $S$…

Number Theory · Mathematics 2009-09-14 Pingzhi Yuan

In this paper, we obtain a characterization of short normal sequences over a finite Abelian p-group, thus answering positively a conjecture of Gao for a variety of such groups. Our main result is deduced from a theorem of Alon, Friedland…

Number Theory · Mathematics 2012-05-28 Benjamin Girard

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

Group Theory · Mathematics 2008-03-11 Günter Lettl , Zhi-Wei Sun

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

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

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 a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

Combinatorics · Mathematics 2025-08-04 Noga Alon , Itai Benjamini , Georgii Zakharov , Maksim Zhukovskii

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

Combinatorics · Mathematics 2025-10-17 Wanzhen Hui , Xue Li

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

Number Theory · Mathematics 2016-06-03 R. Balasubramanian , Gyan Prakash , D. S. Ramana

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

Let $G$ be a finite abelian group of exponent $n$, written additively, and let $A$ be a subset of $\mathbb{Z}$. The constant $s_A(G)$ is defined as the smallest integer $\ell$ such that any sequence over $G$ of length at least $\ell$ has an…

Number Theory · Mathematics 2019-06-13 Filipe Oliveira , Abílio Lemos , Hemar Godinho

For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of…

Combinatorics · Mathematics 2022-07-22 Sameera Vemulapalli