Related papers: Computing Nilpotent Quotients in Finitely Presente…

The main part of this paper contains a description of a nilpotent quotient algorithm for L-presented groups and a report on applications of its implementation in the computer algebra system GAP. The appendix introduces two new infinite…

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

To any family of languages LAN, let us associate the class, denoted $\pi(\text{LAN})$, of finitely generated groups that admit a group presentation whose set of relators forms a language in LAN. We show that the class of L-presented groups,…

We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…

The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…

Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…

Let G be a simple algebraic group over an algebraically closed field with Lie algebra g. Then the orbits of nilpotent elements of g under the adjoint action of G have been classified. We describe a simple algorithm for finding a…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…

We show that every finitely generated nilpotent group of class 2 occurs as the quotient of a finitely presented abelian-by-nilpotent group by its largest nilpotent normal subgroup.

Every non-solvable and non-semisimple quadratic Lie algebra can be obtained as a double extension of a solvable quadratic Lie algebra. Thanks to a partial classification of nilpotent Lie algebras and this result, we can design different…

We adopt the $p$-group generation algorithm to classify small-dimensional nilpotent Lie algebras over small fields. Using an implementation of this algorithm, we list the nilpotent Lie algebras of dimension at most~9 over $\F_2$ and those…

We prove that a finitely generated Lie algebra $L$ such that (i) every commutator in generators is ad-nilpotent, and (ii) $ L$ satisfies a polynomial identity, is nilpotent. As a corollary we get that a finitely generated residually-$p$…

In this note we present some experimental results on the general matrix nilpotent Lie algebras derived by calculations on a computer

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

An equivalent condition for an element of a Lie algebra acting nilpotently in all its representations is obtained. Namely, it should belong to the derived algebra and go via factoring over the radical to a nilpotent element of the…

Every finite dimensional real representation of a compact real semisimple Lie algebra determines a metric 2-step nilpotent Lie algebra and a corresponding simply connected metric 2-step nilpotent Lie group N. We study the differential…

A Lie algebra L is known to be nilpotent if it admits a grading by (Zp, +) with support X not containing 0. It is also known that the class of L can be bounded by some explicit function of |X|. We generalise this and other classical results…

We sharpen the orbit method for finite groups of small nilpotence class by associating representations to functionals on the corresponding Lie rings. This amounts to describing compatible intertwiners between representations parameterized…

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

Let $G$ be an adjoint algebraic group of type $B$, $C$, or $D$ over an algebraically closed field of characteristic 2. We construct a Springer correspondence for the Lie algebra of $G$. In particular, for orthogonal Lie algebras in…