Open AccessOn the number of tame concealed convex subcategories in cycle-finite algebras
Author(s) -
Piotr Malicki
Publication year - 2020
Publication title -
transactions of the american mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.798
H-Index - 100
eISSN - 1088-6850
pISSN - 0002-9947
DOI - 10.1090/tran/8238
Subject(s) - annotation , algorithm , indecomposable module , semantics (computer science) , convex hull , computer science , type (biology) , mathematics , artificial intelligence , regular polygon , discrete mathematics , geometry , programming language , ecology , biology
We prove that for every cycle-finite algebra A A the number of pairwise different tame concealed convex subcategories of the convex hull of the support of an indecomposable A A -module is bounded by 3 3 .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom