Burnside Matrices and Subgroup Embeddings in Finite Groups

V. I. Mysovskikh ()
Additional contact information
V. I. Mysovskikh: St. Petersburg State University

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 528-533 from Springer

Abstract: Abstract We apply the technique of Burnside matrices (tables of marks) to recognition of subgroup embeddings in a finite group. This tool allowed us to work out efficient tests for such embedding properties as abnormality, pronormality, paranormality, their weak analogies (weak abnormality, extended Frattini argument, polynormality), the subnormalizer condition and weak normality in the sense of K. H. Müller. Two combinatorial functions on the subgroup lattice of a finite group are considered. Both of them may be computed with the help of the respective table of marks. The algorithms are implemented within the computer algebra package GAP, version 4.1. Our codes make use of the library TOM there and fulfil calculations with integers instead of computing with group elements. Three long-standing problems in the area of subgroup embeddings were solved with the help of these programs. The respective counterexamples are described. In addition to the plenary talk the author would like to demonstrate his codes.

Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_50

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_50

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().