1 citations · 1 across the 3 of their papers we have counts for
4 papers
The word problem for polycyclic groups and nilpotent associative algebras
Tobias Moede, Matthias Neumann-Brosig
The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types o…
Computing subalgebras and -gradings of simple Lie algebras over finite fields
Bettina Eick, Tobias Moede
This paper introduces two new algorithms for Lie algebras over finite fields and applies them to the investigate the known simple Lie algebras of dimension at most over the fi…
Galois trees in the graph of -groups of maximal class
Alexander Cant, Heiko Dietrich, Bettina Eick +1
The investigation of the graph associated with the finite -groups of maximal class was initiated by Blackburn (1958) and became a deep and interesting research t…
The Modular Isomorphism Problem for small groups -- revisiting Eick's algorithm
L. Margolis, T. Moede
We study the Modular Isomorphism Problem (MIP) for groups of small order based on an improvement of an algorithm described by B. Eick. Our improvement allows to determine quotients…