An effective version of the Lazard correspondence. (Q435965): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(10 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
The Lazard correspondence provides an isomorphism between the categories of nilpotent Lie rings and finite \(p\)-groups which have the same order \(p^n\) and the same nilpotence class \(c\), for \(c<p\). The Baker-Campbell-Hausdorff formula, and its inverse, allow one to define the group operation in terms of the Lie ring ones, and vice versa. (See the book `\(p\)-automorphisms of finite \(p\)-groups' by \textit{E.~I.~Khukhro} [Lond. Math. Soc. Lect. Note Ser. 246. Cambridge: Cambridge University Press (1998; Zbl 0897.20018)].) The goal of the paper under review is to develop computational methods to perform the Lazard correspondence in practice. These methods have been implemented both in MAGMA and GAP. The programmes are currently able to deal with \(p\)-groups and Lie rings of class up to \(14\). Some applications are described. One is the computation of faithful modules for groups as above; a comparison is drawn with other methods. The other is the computation of Hall polynomials, which are formulas for multiplying elements, given in the so called product representation, in groups as above. We refer to the paper, which is very clearly written, for an interesting discussion of the relative advantages of this method with respect to collection, and further details. | |||
Property / review text: The Lazard correspondence provides an isomorphism between the categories of nilpotent Lie rings and finite \(p\)-groups which have the same order \(p^n\) and the same nilpotence class \(c\), for \(c<p\). The Baker-Campbell-Hausdorff formula, and its inverse, allow one to define the group operation in terms of the Lie ring ones, and vice versa. (See the book `\(p\)-automorphisms of finite \(p\)-groups' by \textit{E.~I.~Khukhro} [Lond. Math. Soc. Lect. Note Ser. 246. Cambridge: Cambridge University Press (1998; Zbl 0897.20018)].) The goal of the paper under review is to develop computational methods to perform the Lazard correspondence in practice. These methods have been implemented both in MAGMA and GAP. The programmes are currently able to deal with \(p\)-groups and Lie rings of class up to \(14\). Some applications are described. One is the computation of faithful modules for groups as above; a comparison is drawn with other methods. The other is the computation of Hall polynomials, which are formulas for multiplying elements, given in the so called product representation, in groups as above. We refer to the paper, which is very clearly written, for an interesting discussion of the relative advantages of this method with respect to collection, and further details. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 17B30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20D15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20-04 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 17-08 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 17B05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6055232 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite \(p\)-groups | |||
Property / zbMATH Keywords: finite \(p\)-groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nilpotent Lie rings | |||
Property / zbMATH Keywords: nilpotent Lie rings / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Lazard correspondence | |||
Property / zbMATH Keywords: Lazard correspondence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
effective methods | |||
Property / zbMATH Keywords: effective methods / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Baker-Campbell-Hausdorff formula | |||
Property / zbMATH Keywords: Baker-Campbell-Hausdorff formula / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Andrea Caranti / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Guarana / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: LieRing / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: GAP / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Magma / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jalgebra.2011.11.031 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056399532 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using the Mal'cev correspondence for collection in polycyclic groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynkin’s method of computing the terms of the Baker–Campbell–Hausdorff series / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Magma algebra system. I: The user language / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5655596 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing faithful representations for nilpotent Lie algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for computing the Baker–Campbell–Hausdorff series and some of its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Higman's PORC conjecture for a family of groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A partial extension of Lazard's correspondence for finite \(p\)-groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The formal power series for \(\log\,e^x e^y\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4377749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Collection from the left and other strategies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symbolic Collection using Deep Thought / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5805034 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Groups and nilpotent Lie rings whose order is the sixth power of a prime. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical values of Goldberg’s coefficients in the series for 𝑙𝑜𝑔(𝑒^{𝑥}𝑒^{𝑦}) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix representations for torsion-free nilpotent groups by Deep Thought. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The groups with order \(p^7\) for odd prime \(p\). / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple expression for the terms in the Baker–Campbell–Hausdorff series / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4285784 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cyclic Relations and the Goldberg Coefficients in the Campbell-Baker- Hausdorff Formula / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Collection from the left / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4288980 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:46, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An effective version of the Lazard correspondence. |
scientific article |
Statements
An effective version of the Lazard correspondence. (English)
0 references
13 July 2012
0 references
The Lazard correspondence provides an isomorphism between the categories of nilpotent Lie rings and finite \(p\)-groups which have the same order \(p^n\) and the same nilpotence class \(c\), for \(c<p\). The Baker-Campbell-Hausdorff formula, and its inverse, allow one to define the group operation in terms of the Lie ring ones, and vice versa. (See the book `\(p\)-automorphisms of finite \(p\)-groups' by \textit{E.~I.~Khukhro} [Lond. Math. Soc. Lect. Note Ser. 246. Cambridge: Cambridge University Press (1998; Zbl 0897.20018)].) The goal of the paper under review is to develop computational methods to perform the Lazard correspondence in practice. These methods have been implemented both in MAGMA and GAP. The programmes are currently able to deal with \(p\)-groups and Lie rings of class up to \(14\). Some applications are described. One is the computation of faithful modules for groups as above; a comparison is drawn with other methods. The other is the computation of Hall polynomials, which are formulas for multiplying elements, given in the so called product representation, in groups as above. We refer to the paper, which is very clearly written, for an interesting discussion of the relative advantages of this method with respect to collection, and further details.
0 references
finite \(p\)-groups
0 references
nilpotent Lie rings
0 references
Lazard correspondence
0 references
effective methods
0 references
Baker-Campbell-Hausdorff formula
0 references
0 references
0 references