2000
DOI: 10.1007/978-1-4419-8750-1
|View full text |Cite
|
Sign up to set email alerts
|

Abelian Groups and Representations of Finite Partially Ordered Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
107
0

Year Published

2000
2000
2017
2017

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 76 publications
(107 citation statements)
references
References 0 publications
0
107
0
Order By: Relevance
“…In the remarks prior to the theorem we have established that (1) implies (2). Since dim Q (D) = dim Q (QA), D and QA are isomorphic Q-spaces and since both are D-spaces, we get that dim D (QA) = 1.…”
Section: Now From Wedderburn's Principal Theorem Qend(a) = D + J(qenmentioning
confidence: 81%
“…In the remarks prior to the theorem we have established that (1) implies (2). Since dim Q (D) = dim Q (QA), D and QA are isomorphic Q-spaces and since both are D-spaces, we get that dim D (QA) = 1.…”
Section: Now From Wedderburn's Principal Theorem Qend(a) = D + J(qenmentioning
confidence: 81%
“…Since G has no direct summand of rank 2 the coordinate matrix has no 0-column. Moreover, the part [β 1 | β 2 ] has no 0-row, since otherwise, by Lemma 14, an S-reduced form of [β 1 | β 2 ] would have a 0-row, and G would have a direct summand of rank 2 by Corollary 26 (2). Thus [β 1 | β 2 ] has no 0-lines.…”
Section: Proposition 27 If the Partmentioning
confidence: 99%
“…Almost completely decomposable groups are a notoriously complicated class of torsion-free abelian groups of finite rank ( [15], [2], [17]), the source of many pathological decompositions ( [13]) and have been generalized to infinite rank ( [18]). …”
Section: Introductionmentioning
confidence: 99%
“…Finally, we would like to point that Arnold described some relationships between Butler groups and representations of finite posets over discrete valuation rings. According to Arnold [1] computations of representation type of representations of posets over discrete valuation rings lead to explicit procedures for constructing indecomposable almost completely decomposable groups of arbitrarily large finite rank with types in a fixed finite set of types. Such constructions are quite difficult without the assistance of techniques from representation theory.…”
Section: Researchmentioning
confidence: 99%