Searcharxiv⌕ Search

arXiv subjects

Yuanlin Li

Publications and source records attributed to Yuanlin Li.

21 records · Page 2Linked to original sources

Minimal zero-sum sequences of length five over finite cyclic groups

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 the minimum of $(n_1+\cdots+n_l)/\ord(g)$ over all possible $g\in G$ such that $\langle g \rangle =G$. In this paper, we determine the index of any minimal zero-sum sequence $S$ of length 5 when $G=\langle g\rangle$ is a cyclic group of a prime order and $S$ has the form $S=g^2(n_2g)(n_3g)(n_4g)$. It is shown that if $G=\langle g\rangle$ is a cyclic group of prime order $p \geq 31$, then every minimal zero-sum sequence $S$ of the above mentioned form has index 1 except in the case that $S=g^2(\frac{p-1}{2}g)(\frac{p+3}{2}g)((p-3)g)$.

math.CO↗

Minimal zero-sum sequences of length four over finite cyclic groups II

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 $(n_1+\cdots+n_l)/\ord(g)$ over all possible $g\in G$ such that $\langle g \rangle =G$. An open problem on the index of length four sequences asks whether or not every minimal zero-sum sequence of length 4 over a finite cyclic group $G$ with $\gcd(|G|, 6)=1$ has index 1. In this paper, we show that if $G=\langle g\rangle$ is a cyclic group with order of a product of two prime powers and $\gcd(|G|, 6)=1$, then every minimal zero-sum sequence $S$ of the form $S=(g)(n_2g)(n_3g)(n_4g)$ has index 1. In particular, our result confirms that the above problem has an affirmative answer when the order of $G$ is a product of two different prime numbers or a prime power, extending a recent result by the first author, Plyley, Yuan and Zeng.

math.CO↗

On the Index of Sequences over Cyclic Groups

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 the minimum of $(n_1+ ... + n_l)/\ord (g)$ over all $g \in G$ with $\ord (g) = n$. In this paper we prove that a sequence $S$ over $G$ of length $|S| = n$ having an element with multiplicity at least $\frac{n}{2}$ has a subsequence $T$ with $\ind (T) = 1$, and if the group order $n$ is a prime, then the assumption on the multiplicity can be relaxed to $\frac{n-2}{10}$. On the other hand, if $n=4k+2$ with $k \ge 5$, we provide an example of a sequence $S$ having length $|S| > n$ and an element with multiplicity $\frac{n}{2}-1$ which has no subsequence $T$ with $\ind (T) = 1$. This disproves a conjecture given twenty years ago by Lemke and Kleitman.

math.CO↗