IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-04166-6_50.html

Burnside Matrices and Subgroup Embeddings in Finite Groups

In: Formal Power Series and Algebraic Combinatorics

Author

Listed:
  • V. I. Mysovskikh

    (St. Petersburg State University)

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.

Suggested Citation

  • V. I. Mysovskikh, 2000. "Burnside Matrices and Subgroup Embeddings in Finite Groups," Springer Books, in: Daniel Krob & Alexander A. Mikhalev & Alexander V. Mikhalev (ed.), Formal Power Series and Algebraic Combinatorics, pages 528-533, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-04166-6_50
    DOI: 10.1007/978-3-662-04166-6_50
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-04166-6_50. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.