AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (256.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

The counting formula for indecomposable modules over string algebra

Haicun Wen1( )Mian-Tao Liu2( )Yu-Zhe Liu3
Lanzhou Resources & Environment Voc-Tech University, Lanzhou 730022, China
Department of Mathematics, Nanjing University, Nanjing 210093, China
School of Mathematics and Statistics, Guizhou University, Guiyang 550025, China
Show Author Information

Abstract

Let A=kQ/I be a string algebra. We show that, if for any vertex v of its bound quiver (Q,I), there exists at most one arrow (resp. at most two arrows) ending with v and there exist at most two arrows (resp. at most one arrow) starting with v, then the number of indecomposable modules over A is dimkA+Σ, where Σ is induced by radP(v) (resp. E(v)/socE(v)) with decomposable socle (resp. top), where P(v) (resp. E(v)) is the indecomposable projective (resp. injective) module corresponded by the vertex v.

CLC number: 16G10, 16G20, 16G60

References

【1】
【1】
 
 
AIMS Mathematics
Pages 24977-24988

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Wen H, Liu M-T, Liu Y-Z. The counting formula for indecomposable modules over string algebra. AIMS Mathematics, 2024, 9(9): 24977-24988. https://doi.org/10.3934/math.20241217

110

Views

0

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 19 June 2024
Revised: 09 August 2024
Accepted: 14 August 2024
Published: 15 September 2024
©2024 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)