2022
DOI: 10.48550/arxiv.2211.08515
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Structure of a sequence with prescribed zero-sum subsequences: Rank Two $p$-groups

Abstract: Let G = (Z/nZ) ⊕ (Z/nZ). Let s ≤k (G) be the smallest integer ℓ such that every sequence of ℓ terms from G, with repetition allowed, has a nonempty zero-sum subsequence with length at most k. It is known thatwith the structure of extremal sequences showing this bound tight determined when k ∈ {0, 1, n − 1}, and for various special cases when k ∈ [2, n − 2]. For the remaining values k ∈ [2, n − 2], the characterization of extremal sequences of length 2n − 2 + k avoiding a nonempty zero-sum of length at most 2n … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 10 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?