All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 5 of 5

Showing per page

A computer algebra solution to a problem in finite groups.

Gert-Martin Greuel (2003)

Revista Matemática Iberoamericana

We report on a partial solution of the conjecture that the class of finite solvable groups can be characterised by 2-variable identities. The proof requires pieces from number theory, algebraic geometry, singularity theory and computer algebra. The computations were carried out using the computer algebra system SINGULAR.

Algorithms for permutability in finite groups

Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramón Esteban-Romero (2013)

Open Mathematics

In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.

Currently displaying 1 – 5 of 5

Page 1