Nilpotent associative algebras and coclass theory. (Q2343516): Difference between revisions
From MaRDI portal
Latest revision as of 02:37, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nilpotent associative algebras and coclass theory. |
scientific article |
Statements
Nilpotent associative algebras and coclass theory. (English)
0 references
6 May 2015
0 references
In the very interesting paper under review, the authors develop a coclass theory for nilpotent associative algebras over a field \(\mathbf F\). The approach to the theory of finite \(p\)-groups via the coclass invariant, as introduced by \textit{C. R. Leedham-Green} and \textit{M. F. Newman} [Arch. Math. 35, 193-202 (1980; Zbl 0437.20016)] has been extremely successful. Leedham-Green and Newman formulated certain conjectures A-E, which were later established by \textit{C. R. Leedham-Green} [J. Lond. Math. Soc., II. Ser. 50, No. 1, 49-67 (1994; Zbl 0822.20018)] and \textit{A. Shalev} [Invent. Math. 115, No. 2, 315-345 (1994; Zbl 0795.20009)]. In the paper under review, a precise description is given of the infinite paths in the graph of nilpotent associative \(\mathbf F\)-algebras of coclass \(r\). This implies that the corresponding inverse limits are soluble, which establishes the equivalent of Conjecture C. Then it is shown that the number of essentially different infinite paths is finite if and only if \(r\leq 1\), or the field \(\mathbf F\) is finite. The latter result shows precisely under which conditions does the equivalent of Conjecture D hold. Now Conjecture E follows from C and D. As to Conjectures A and B, the authors remark that they appear to require different methods from those employed in the paper under review.
0 references
nilpotent algebras
0 references
finite \(p\)-groups
0 references
coclass theory
0 references
coclass graphs
0 references
infinite paths
0 references
coclass conjectures
0 references
extensions of rings by ideals
0 references
formal power series
0 references