Searching for "Computing Normal Subgroups." – sorted by Relevance.
-
Computing Normal Subgroups
- Abstract This note presents a new algorithm for the computation of the set of normal subgroups
- Cited by 2 (2 self) – Add To MetaCart
-
unknown title
- of random elements in simple normal subgroups: computer experiments Here we give a brief discussion of some
- Add To MetaCart
-
Todt. In addition, the notes were revised and polished by Stephen Simpson.
- Theorem 1.2.8. If 〈G, ·〉 is a computable group and N ⊆ G is a computable normal subgroup of G
- Add To MetaCart
-
An Introduction to Computational Group Theory
- , normalizers, and Frattini subgroups can be computed, and it is possible to find automorphism groups
- Cited by 10 (1 self) – Add To MetaCart
-
The Andrews-Curtis Conjecture and Black Box Groups
- ) of a normal subgroup N in a group G. The vertices of the graph are k-tuples of elements in N which
- Cited by 3 (2 self) – Add To MetaCart
-
Questions in Computable Algebra and Combinatorics
- , vector spaces modulo a subspace. If the underlying structure is computable, but the normal subgroup
- Cited by 4 (0 self) – Add To MetaCart
-
Testing polycyclicity of finitely generated rational matrix groups
- -sequence (g1U,...,gnU) forG/U where U is a unipotent radical. 3: compute normal subgroup generators for U. 4
- Cited by 1 (1 self) – Add To MetaCart

