English
Related papers

Related papers: On the number of fully weighted zero-sum subsequen…

200 papers

Let $G$ be an additive finite abelian group with exponent $\exp(G)$. For $L\subseteq \mathbb N$, let $\mathsf{s}_{L}(G)$ be the smallest integer $\ell$ such that every sequence $S$ over $G$ of length $\ell$ has a zero-sum subsequence $T$ of…

Combinatorics · Mathematics 2023-10-10 Shiwen Zhang

Let $G$ be a finite abelian group and $S$ a sequence with elements of $G$. Let $|S|$ denote the length of $S$ and $\mathrm{supp}(S)$ the set of all the distinct terms in $S$. For an integer $k$ with $k\in [1, |S|]$, let $\Sigma_{k}(S)…

Combinatorics · Mathematics 2024-04-30 Rui Wang , Han Chao , Jiangtao Peng

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$ elements. For a positive integer $d$, let $\mathsf{s}_{d\mathbb{N}}(G)$ denote the smallest integer $\ell\in \mathbb{N}_0\cup \{+\infty\}$ such that every sequence $S$…

Combinatorics · Mathematics 2020-04-01 Kevin Zhao

Let $A,B\subseteq\mathbb Z_n$ be given and $S=(x_1,\ldots, x_k)$ be a sequence in $\mathbb Z_n$. We say that $S$ is an $(A,B)$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ and $b_1,\ldots,b_k\in B$ such that…

Number Theory · Mathematics 2026-01-07 Krishnendu Paul , Shameek Paul

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

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 minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with…

Number Theory · Mathematics 2022-11-17 John Ebert , David J. Grynkiewicz

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

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Number Theory · Mathematics 2010-07-05 Alfred Geroldinger , David J. Grynkiewicz , Wolfgang A. Schmid

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

Combinatorics · Mathematics 2015-09-08 Michiel Kosters

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

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

Let $A,B$ be nonempty subsets of a an abelian group $G$. Let $N_i(A,B)$ denote the set of elements of $G$ having $i$ distinct decompositions as a product of an element of $A$ and an element of $B$. We prove that $$ \sum _{1\le i \le t} |N_i…

Number Theory · Mathematics 2008-04-17 Y. O. Hamidoune , O. Serra

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 $\varepsilon_1…

Commutative Algebra · Mathematics 2023-09-13 Florin Fabsits , Alfred Geroldinger , Andreas Reinhart , Qinghai Zhong

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

Number Theory · Mathematics 2007-07-16 R Thangadurai

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Combinatorics · Mathematics 2026-05-29 Collier Gaiser , Paul Horn

Let $G$ be a finite cyclic group of order $n \ge 2$. 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,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

Combinatorics · Mathematics 2011-03-14 Weidong Gao , Yuanlin Li , Jiangtao Peng , Chris Plyley , Guoqing Wang

The Davenport constant for a finite abelian group $G$ is the minimal length $\ell$ such that any sequence of $\ell$ terms from $G$ must contain a nontrivial zero-sum sequence. For the group $G=(\mathbb Z/n\mathbb Z)^2$, its value is $2n-1$,…

Number Theory · Mathematics 2021-07-23 David J. Grynkiewicz

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