A bypass of an arrow is sectional (Q1203526): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Nonexistent cycles / rank | |||
Normal rank |
Revision as of 13:39, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bypass of an arrow is sectional |
scientific article |
Statements
A bypass of an arrow is sectional (English)
0 references
10 February 1993
0 references
Let \((\Gamma,\tau)\) be a locally finite translation quiver with no multiple arrows or cycles. Given an arrow \(x@>\alpha>> z\), every path \(x = y_ 0 \to y_ 1 \to \dots\to y_ n = z\), with \(n\geq 2\) is called a bypass of \(\alpha\). The main question here is when is it that an arrow admits sectional bypasses. One interesting result implies that, in a connected component \(\mathcal C\) of the Auslander-Reiten quiver of an Artin algebra, if \(\mathcal C\) has no cycles, then every bypass of an arrow is sectional. Another result implies that, if the Artin algebra is of finite representation type, then an irreducible map admits no sectional bypasses.
0 references
locally finite translation quiver
0 references
sectional bypasses
0 references
connected component
0 references
Auslander-Reiten quiver
0 references
Artin algebra
0 references
finite representation type
0 references
irreducible map
0 references