2013
DOI: 10.1007/978-3-319-00416-7
|View full text |Cite
|
Sign up to set email alerts
|

Structural Additive Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
132
0
2

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 140 publications
(135 citation statements)
references
References 0 publications
1
132
0
2
Order By: Relevance
“…The study of sequences, subsequence sums, and zero-sums is a flourishing subfield of Additive Group and Number Theory (see, for example, [31], [40], and [43]). The Davenport constant D(G 0 ), defined as…”
Section: Krull Monoids Monoids Of Modules and Transfer Homomorphismsmentioning
confidence: 99%
“…The study of sequences, subsequence sums, and zero-sums is a flourishing subfield of Additive Group and Number Theory (see, for example, [31], [40], and [43]). The Davenport constant D(G 0 ), defined as…”
Section: Krull Monoids Monoids Of Modules and Transfer Homomorphismsmentioning
confidence: 99%
“…In particular, zero-sum theoretical invariants (such as the Davenport constant or the cross number) and the associated inverse problems play a crucial role (surveys and detailed presentations of such results can be found in [8,10,17]). Most of these invariants are 722 Q. Zhong well understood only in a very limited number of cases (e.g., for groups of rank two, the precise value of the Davenport constant D(G) is known and the associated inverse problem is solved; however, if n is not a prime power and r ≥ 3, then the precise value of the Davenport constant D(C r n ) is unknown).…”
Section: Given Two Finite Abelian Groups G and G Withmentioning
confidence: 99%
“…Our notation and terminology are consistent with [8,10,17]. Let N denote the set of positive integers and N 0 = N ∪ {0}.…”
Section: Background On Krull Monoids and Their Sets Of Minimal Distancesmentioning
confidence: 99%
“…By a sequence over G, we mean a finite sequence of terms from G where repetition is allowed and the order is disregarded. As usual (see [14,17]), we consider sequences as elements of the free abelian monoid F (G) with basis G. A sequence S over G will be written in the form…”
Section: Preliminariesmentioning
confidence: 99%
“…Based on the Savchev-Chen Structure Theorem [17,Section 11.3] (resp. on a related result on the index of sequences) Gao and Geroldinger [11] showed that for every cyclic group G and every k ∈ N we have ρ 2k+1 (H) = kD(G) + 1.…”
Section: Introductionmentioning
confidence: 99%