Zobrazeno 1 - 10
of 109
pro vyhledávání: '"Bettina Eick"'
Publikováno v:
Oberwolfach Reports. 18:2027-2087
Publikováno v:
Journal of Algebra. 604:429-450
The investigation of the graph $\mathcal{G}_p$ associated with the finite $p$-groups of maximal class was initiated by Blackburn (1958) and became a deep and interesting research topic since then. Leedham-Green and McKay (1976-1984) introduced skelet
Autor:
Bettina Eick, Matthias Neumann-Brosig
Publikováno v:
Journal of Algebra. 591:523-537
We present a novel, practical method to determine the Frattini subgroup of a polycyclic group. This method is based on new theoretical investigations about complements and module structure of elementary abelian sections in polycyclic groups. We have
Publikováno v:
Journal of Symbolic Computation. 106:68-77
A symbolic Lie p-ring presentation defines a family of nilpotent Lie rings with p n elements for infinitely many primes p and a fixed positive integer n. Symbolic Lie p-ring presentations are used in the classification of isomorphism types of nilpote
Publikováno v:
Jahresbericht der Deutschen Mathematiker-Vereinigung.
Autor:
Bettina Eick, Michael Vaughan-Lee
Publikováno v:
Journal of Algebra. 545:198-212
Counting problems whose solution is PORC were introduced in a famous paper by Higman (1960). We consider two specific counting problems with PORC solutions: the number of isomorphism types of d-generator class-2 Lie algebras over F q (as a function i
Autor:
Tobias Moede, Bettina Eick
Publikováno v:
75 Years of Mathematics of Computation
Autor:
Derek F. Holt, Bettina Eick
Publikováno v:
Journal of Algebra. 545:1-3
Publikováno v:
Journal of the London Mathematical Society. 100:731-756
We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in $GL(n,Z)$ of a ma
Autor:
Bettina Eick, Alexander Cant
Publikováno v:
Journal of Symbolic Computation. 92:203-210
A famous result of Hall asserts that the multiplication and exponentiation in finitely generated torsion-free nilpotent groups can be described by rational polynomials. We describe an algorithm to determine such polynomials for all torsion-free nilpo