Counting theorems for finite \(p\)-groups (Q1203557)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Counting theorems for finite \(p\)-groups
scientific article

    Statements

    Counting theorems for finite \(p\)-groups (English)
    0 references
    0 references
    10 February 1993
    0 references
    Let \(k\) be a positive integer, \(p\) a prime. A \(p\)-group \(G\) is said to be \(k\)-tame if: 1) \(G\) contains a subgroup of order \(p^ k\) and exponent \(p\); 2) if \(G_ 1\) is a subgroup of order \(p^{k + 1}\) in \(G\), and \(G_ 1\) contains a subgroup of order \(p^ k\) and exponent \(p\) then \(G_ 1\) is regular. Let \(\chi(G) = \max\{k \in \mathbb{N} \mid G\) is \(k\)- tame\}. The author investigates the structure of finite \(p\)-groups \(G\) with \(\chi(G) = \chi > 1\). In particular it is proved that if \(G\) is a \(p\)- group, \(\chi > 1\), then: 1) \(C_ 1(G) \equiv 1 + p + \cdots + p^{\chi -1} \pmod {p^ \chi}\); 2) if \(\exp G \geq p^ n\) then \(| \text{sol }_ n(G) | \equiv 0 \pmod {p^{\chi + n - 1}}\); 3) if \(n > 1\) then \(c_ n(G) \equiv 0 \pmod {p^{\chi - 1}}\), where \(c_ n(G)\) is the number of cyclic subgroups of order \(p^ n\) in \(G\), \(\text{sol }_ n(G) = \{x \in G \mid x^{p^ n} = 1\}\). If \(G\) is an irregular \(p\)-group then the famous classical results due to P. Hall are corollaries of the results obtained by the author.
    0 references
    0 references
    0 references
    0 references
    0 references
    tame \(p\)-groups
    0 references
    order
    0 references
    exponent
    0 references
    finite \(p\)-groups
    0 references
    number of cyclic subgroups
    0 references
    irregular \(p\)-groups
    0 references
    0 references