网络准同构 网络释义 1. 准同构 是准同构(quasi-isomorphism)。 frankliou.wordpress.com|基于2个网页
Quasi-isomorphic variantsFor QTAG-modules the concept of quasi-isomorphism was defined by Mehdi [5]. Two QTAG-modules are quasi-isomorphic when they contain cobounded submodules. Here we prove that cobounded submodules inherit basic submodules. Then we impose some restrictions on quasi-...
Mixed Abelian group, homomorphism group, quasi-isomorphismThis paper investigates to which extent a self-small mixed Abelian group G of finite torsion-free rank is determined by the groups Hom(G,C) where C is chosen from a suitable class $mathcal C$ of Abelian groups. We show that G is ...
primary Abelian groups G and H to bequasi-isomorphic if and only if there exists positive integersm and n and subgroups S and T of G and H, respectively, such that pnG c S, pmH c T and S = T, the second question is:Whatdoes quasi-isomorphism have to say about primary Abelian...
We show that G is determined up to quasi-isomorphism if is the class of all self-small mixed groups C with r0(C) ≤ r0(G). Several related results are given, and the dual problem of orthogonal classes is investigated.关键词:Mixed Abelian group homomorphism group quasi-isomorphism ...
quasi isomorphism of modules专业释义 <数学> 模的拟同构词条提问 欢迎你对此术语进行提问>> 行业词表 石油纺织轻工业造纸采矿信息学农业冶金化学医学医药地理地质外贸建筑心理学数学机械核能汽车海事消防物理生物学电力电子金融财会证券法律管理经贸人名药名解剖学胚胎学生理学药学遗传学中医印刷商业商务大气科学天文岩土工程...
Let (X,U) be a quasi-uniform space and let Q(X) be the set of all (quasi)-uniform self-isomorphisms of (X,U). Generalizing a known result about uniformities to quasi-uniformities, P. Fletcher [Arch. Math. 22, 88-93 (1971; Zbl 0215.52604)] proved that if we equip Q(X) with...
Isomorphisms of the endomorphism rings of a class of torsion-free modules The present level of world catches is considered and the rate annual increment during the last years is analyzed. The total biomass data and the productivi... KG Wolfson - 《Proceedings of the American Mathematical Society...
Graph Isomorphism in Quasipolynomial Time 来自 arXiv.org 喜欢 0 阅读量: 115 作者: L Babai 摘要: We show that the Graph Isomorphism (GI) problem and the more general problems of String Isomorphism (SI) andCoset Intersection (CI) can be solved in quasipolynomial(exp((logn)O(1))) time....
Graph Isomorphism in Quasipolynomial Time 来自 arXiv.org 喜欢 0 阅读量: 153 作者: L Babai 摘要: We show that the Graph Isomorphism (GI) problem and the more general problems of String Isomorphism (SI) andCoset Intersection (CI) can be solved in quasipolynomial(exp((logn)O(1))) time....