Skip to main content
Log in

Indecomposability and the number of links

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

Let (ℋ, ℳ) be a linear matrix problem induced from a finite dimensional algebra ∧. Then an × matrix M in R(ℋ, ℳ) is indecomposable if and only if the number of links in the canonical formM (∞) of M is equal to. ℳ-dim − 1. On the other hand, the dimension of the endomorphism ring of M is equal to ℋ-dim − σ(M).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Crawley-Boevey, W. W., Matrix problems and Drozd’s theorem, Topics in Algebra, 1990, 26: 199–222.

    MathSciNet  Google Scholar 

  2. Sergeichuk, V. V., Canonical matrices for linear matrix problems, Linear Algebra and Its Applications, 2000, 317(1–3): 53–102.

    Article  MATH  MathSciNet  Google Scholar 

  3. Zeng Xiangyong, Zhang Yingbo, A correspondence of almost split sequences between some categories, Comm. Alg., 2001, 29 (2): 557–582.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yunge Xu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, Y., Zhang, Y. Indecomposability and the number of links. Sci. China Ser. A-Math. 44, 1515–1522 (2001). https://doi.org/10.1007/BF02880791

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02880791

Keywords

Navigation