Matching simple modules of condensation algebras

Q1 Mathematics

Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI:10.1112/S1461157012001118

Felix Noeske

引用次数: 2

Abstract

We revise the matching algorithm of Noeske ( LMS J. Comput. Math. 11 (2008) 213–222) and introduce a new approach via composition series to expedite the calculations. Furthermore, we show how the matching algorithm may be applied in the more general and frequently occurring setting that we are only given subalgebras of the condensed algebras which each contain the separable algebra of one of their Wedderburn–Malcev decompositions.

查看原文本刊更多论文

缩合代数的简单模匹配

对Noeske (LMS J. Comput)的匹配算法进行了改进。数学。11(2008)213-222)，并介绍了一种新的方法，通过组成系列来加快计算。此外，我们展示了匹配算法如何应用于更一般的和频繁发生的设置，我们只给出了压缩代数的子代数，每个子代数都包含它们的一个Wedderburn-Malcev分解的可分离代数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Lms Journal of Computation and Mathematics MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

2.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： LMS Journal of Computation and Mathematics has ceased publication. Its final volume is Volume 20 (2017). LMS Journal of Computation and Mathematics is an electronic-only resource that comprises papers on the computational aspects of mathematics, mathematical aspects of computation, and papers in mathematics which benefit from having been published electronically. The journal is refereed to the same high standard as the established LMS journals, and carries a commitment from the LMS to keep it archived into the indefinite future. Access is free until further notice.