Galois covering technique and tame non-simply connected posets of polynomial growth (Q1971131): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1233033 |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / reviewed by | |||
Property / reviewed by: M. M. Kleiner / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:24, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Galois covering technique and tame non-simply connected posets of polynomial growth |
scientific article |
Statements
Galois covering technique and tame non-simply connected posets of polynomial growth (English)
0 references
22 August 2002
0 references
Let \(k\) be an algebraically closed field and let \(S\) be a finite partially ordered set (poset). Let \(Q_S\) be the quiver whose vertices are the elements of \(S\) and whose arrows are described as follows: for \(x,y\in S\) there is an arrow \(x\to y\) in \(Q_S\) if and only if \(x<y\) in \(S\). The set \(S\) is said to be simply connected if so is the factor algebra of the path algebra \(kQ_S\) modulo the ideal generated by all commutativity relations [\textit{I. Assem} and \textit{A. Skowroński}, Proc. Lond. Math. Soc., III. Ser. 56, No. 3, 417-450 (1988; Zbl 0617.16018)]. The authors show that if \(S\) is not simply connected, then it is of tame prinjective type and of polynomial growth over \(k\) if and only if: (a) the Tits form of \(S\) is weakly nonnegative and (b) no subset of \(S\) belongs to one of three specific families of posets. For the terminology, the reader is referred to \textit{D. Simson} [Linear representations of partially ordered sets and vector space categories. Algebra, Logic and Applications, 4. Gordon and Breach Science Publishers, Brooklyn (1992; Zbl 0818.16009)].
0 references
finite partially ordered sets
0 references
tame prinjective representation type
0 references
simply connected posets
0 references
polynomial growth
0 references
quivers
0 references
path algebras
0 references
Tits forms
0 references
forbidden posets
0 references