English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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 of $(n_1+\cdots+n_l)/\hbox{\rm ord}(g)$ over all possible $g\in G$ such that $\langle g\rangle=G$. A conjecture says that if $G$ is finite such that $\gcd(|G|,6)=1$, then $\ind(S)=1$ for every minimal zero-sum sequence $S$. In this paper, we prove that the conjecture holds if $S$ is reduced and the (A1) condition is satisfied(see [19]).

ON THE INDEX-CONJECTURE ON LENGTH FOUR MINIMAL ZERO-SUM SEQUENCES