English
Related papers

Related papers: On the index-conjecture on the length four minimal…

200 papers

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$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

Number Theory · Mathematics 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li

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

Number Theory · Mathematics 2014-02-03 Li-meng Xia , Caixia Shen

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index $1$. In this paper we prove that if $S$ is singular then the index of…

Number Theory · Mathematics 2017-09-15 Fan Ge

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

Combinatorics · Mathematics 2013-03-08 Yuanlin Li , Jiangtao Peng

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

Combinatorics · Mathematics 2013-03-08 Jiangtao Peng , Yuanlin Li

Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(x_1g)\cdot\ldots\cdot(x_lg)$ where $g\in G$ and $x_1, \ldots, x_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…

Number Theory · Mathematics 2014-02-04 Li-meng Xia , Yuanlin Li , Jiangtao Peng

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index 1. In this note we study the index conjecture and connect it to a…

Number Theory · Mathematics 2016-06-07 Fan Ge

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

A problem in zero-sum theory is to determine all pairs $(k,n)$ for which every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While all other cases have been solved more than a decade ago, the case when $k$ equals $4$ and…

Combinatorics · Mathematics 2020-11-20 Fan Ge

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

Number Theory · Mathematics 2025-10-15 Andrew Pendleton

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

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Combinatorics · Mathematics 2014-09-09 Jiangtao Peng , Fang Sun

Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for…

Combinatorics · Mathematics 2011-01-25 Gerard Jennhwa Chang , Sheng-Hua Chen , Yongke Qu , Guoqing Wang , Haiyan Zhang

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

Number Theory · Mathematics 2008-01-25 Weidong Gao , Alfred Geroldinger , David J. Grynkiewicz

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2019-01-04 Abílio Lemos , Allan O. Moura , Anderson T. Silva , B. K. Moriya

Suppose $G$ is a finite abelian group and $S=g_{1}\cdots g_{l}$ is a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\mathbb{Z}\backslash\left\{ 0\right\} $, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2021-02-01 Abílio Lemos , Allan de Oliveira Moura

Let $G$ be a finite abelian group, and let $\eta(G)$ be the smallest integer $d$ such that every sequence over $G$ of length at least $d$ contains a zero-sum subsequence $T$ with length $|T|\in [1,\exp(G)]$. In this paper, we investigate…

Number Theory · Mathematics 2011-08-16 Yushuang Fan , Weidong Gao , Guoqing Wang , Qinghai Zhong , Jujuan Zhuang

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 a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

Combinatorics · Mathematics 2021-07-19 Weidong Gao , Yuanlin Li , Yongke Qu
‹ Prev 1 2 3 10 Next ›