{"paper":{"title":"Minimal zero-sum sequences of length five over finite cyclic groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiangtao Peng, Yuanlin Li","submitted_at":"2013-03-07T13:15:20Z","abstract_excerpt":"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 p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1676","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}