检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Hong Bo SHI
机构地区:[1]Department of Mathematics, Nanjing University of Finance and Economics
出 处:《Acta Mathematica Sinica,English Series》2015年第4期675-694,共20页数学学报(英文版)
基 金:Supported by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)
摘 要:The main objective of this paper is to study the dimension trees and further the homological dimensions of the extension algebras -- dual and trivially twisted extensions -- with a unified combinatorial approach using the two combinatorial algorithms -- Topdown and Bottomup. We first present a more complete and clearer picture of a dimension tree, with which we are then able, on the one hand, to sharpen some results obtained before and furthermore reveal a few more hidden subtle homological phenomenons of or connections between the involved algebras; on the other hand, to provide two more efficient combinatorial algorithms for computing dimension trees, and consequently the homological dimensions as an application. We believe that the more refined complete structural information on dimension trees will be useful to study other homological properties of this class of extension algebras.The main objective of this paper is to study the dimension trees and further the homological dimensions of the extension algebras -- dual and trivially twisted extensions -- with a unified combinatorial approach using the two combinatorial algorithms -- Topdown and Bottomup. We first present a more complete and clearer picture of a dimension tree, with which we are then able, on the one hand, to sharpen some results obtained before and furthermore reveal a few more hidden subtle homological phenomenons of or connections between the involved algebras; on the other hand, to provide two more efficient combinatorial algorithms for computing dimension trees, and consequently the homological dimensions as an application. We believe that the more refined complete structural information on dimension trees will be useful to study other homological properties of this class of extension algebras.
关 键 词:Topdown bottomup dimension tree SYZYGY finitistic dimensions
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49