2016
DOI: 10.1142/s1793042116500615
|View full text |Cite
|
Sign up to set email alerts
|

Long unsplittable zero-sum sequences over a finite cyclic group

Abstract: Let G be an additively written finite cyclic group of order n and let S be a minimal zero-sum sequence with elements of G, i.e. the sum of elements of S is zero, but no proper nontrivial subsequence of S has sum zero. S is called unsplittable if there do not exist an element g in S and two elements x, y in G such that g = x + y and the new sequence Sg −1 xy is still a minimal zero-sum sequence. In this paper, we investigate long unsplittable minimal zero-sum sequences over G. Our main result characterizes the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Or "long" minimal zero-sum multisets are "narrow". Some different but unrelated results along these lines are in [23,24].…”
Section: Application To Zero-sum Theorymentioning
confidence: 99%
See 1 more Smart Citation
“…Or "long" minimal zero-sum multisets are "narrow". Some different but unrelated results along these lines are in [23,24].…”
Section: Application To Zero-sum Theorymentioning
confidence: 99%
“…The results have direct applications to invariant theory, my motivation to consider them, see [4,11]. Another application domain is the theory of zero-sums, see [2,7,8,23,24], that is essentially another view at the same mathematical subject.…”
mentioning
confidence: 99%