Lower bounds for faithful, preinjective modules (Q1086330)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower bounds for faithful, preinjective modules
scientific article

    Statements

    Lower bounds for faithful, preinjective modules (English)
    0 references
    0 references
    1986
    0 references
    Let A be a k-algebra and \(\tau\) its Auslander-Reiten translation. An interesting problem is to determine the faithful, indecomposable preinjective A-modules, i.e. modules of the form \(\tau^ nI\), with I injective. If A is the path algebra of a quiver \({\vec \Delta}\), there are only a finite number of indecomposable preinjectives which are not faithful. Hence, there is a minimum m(\({\vec \Delta})\) of the numbers n such that \(\tau^ nI\) is always faithful. The maximum of the m(\({\vec \Delta})'s\) for the different orientations of \(\Delta\) is denoted by m(\(\Delta)\). This paper solves the problem of determining m(\(\Delta)\) when \(\Delta\) is a tree of infinite representation type. If \(\Delta\) is a tame tree, it is shown that \(m(\Delta)=r(\Delta)+1\), where r(\(\Delta)\) is the replication number of \textit{R. Bautista} and \textit{S. Brenner} [see Proc. Lond. Math. Soc., III. Ser. 47, 429-462 (1983; Zbl 0505.16012)]. In the general cases m(\(\Delta)\) coincides with the diameter d(\(\Delta)\) of \(\Delta\), and it is always of the form \(m(\Delta)=d(\Delta)+c(\Delta)\) where c(\(\Delta)\) is a constant depending on certain structural properties of \(\Delta\). The paper is very clear and very well written.
    0 references
    Auslander-Reiten translation
    0 references
    indecomposable preinjective A-modules
    0 references
    path algebra
    0 references
    quiver
    0 references
    tree of infinite representation type
    0 references
    tame tree
    0 references
    replication number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references