Displaying 721 – 740 of 10151

Showing per page

Algorithm for the complement of orthogonal operations

Iryna V. Fryz (2018)

Commentationes Mathematicae Universitatis Carolinae

G. B. Belyavskaya and G. L. Mullen showed the existence of a complement for a k -tuple of orthogonal n -ary operations, where k < n , to an n -tuple of orthogonal n -ary operations. But they proposed no method for complementing. In this article, we give an algorithm for complementing a k -tuple of orthogonal n -ary operations to an n -tuple of orthogonal n -ary operations and an algorithm for complementing a k -tuple of orthogonal k -ary operations to an n -tuple of orthogonal n -ary operations. Also we find some...

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 721 – 740 of 10151