pith. sign in

arxiv: 1907.02898 · v1 · pith:KGTVYT5Fnew · submitted 2019-07-05 · 🧮 math.GR · math.CO

On the Intersection Numbers of Finite Groups

Pith reviewed 2026-05-25 01:47 UTC · model grok-4.3

classification 🧮 math.GR math.CO
keywords intersection numberFrattini subgroupmaximal subgroupsnilpotent groupsfinite groupscovering number
0
0 comments X

The pith

Nontrivial finite nilpotent groups admit an exact formula for the minimum number of maximal subgroups whose intersection is the Frattini subgroup.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines the intersection number ι(G) of a nontrivial finite group G as the smallest collection of maximal subgroups whose common intersection equals the Frattini subgroup Φ(G). It supplies a closed-form expression for this number in every case where G is nilpotent. The same quantity is computed explicitly for several infinite families of non-nilpotent groups. The definition supplies a dual counterpart to the covering number σ(G), which instead measures the smallest number of proper subgroups needed to cover the whole group.

Core claim

For a nontrivial finite group G, ι(G) is the minimum number of maximal subgroups whose intersection equals the Frattini subgroup Φ(G). When G is nilpotent this number is given by an exact formula; the paper also determines the value for selected infinite families of non-nilpotent groups and introduces a natural generalization of the invariant.

What carries the argument

The intersection number ι(G), defined as the size of the smallest set of maximal subgroups whose intersection equals Φ(G).

If this is right

  • ι(G) is now known exactly for every nontrivial finite nilpotent group.
  • The intersection numbers of certain infinite non-nilpotent families are completely determined.
  • A natural generalization of ι(G) is available for further study.
  • Several open questions about these invariants are posed for future work.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The formula for nilpotent groups may extend to solvable groups whose maximal subgroups are sufficiently well understood.
  • ι(G) could be compared directly with the minimal number of generators of the Frattini quotient G/Φ(G).
  • Computing ι(G) for symmetric or alternating groups might reveal patterns tied to their subgroup lattices.

Load-bearing premise

The Frattini subgroup equals the intersection of every maximal subgroup, so that a minimal number of them can achieve exactly that intersection.

What would settle it

A single nontrivial finite nilpotent group G together with an explicit list of its maximal subgroups whose intersections fail to match the claimed formula for ι(G).

read the original abstract

The covering number of a nontrivial finite group $G$, denoted $\sigma(G)$, is the smallest number of proper subgroups of $G$ whose set-theoretic union equals $G$. In this article, we focus on a dual problem to that of covering numbers of groups, which involves maximal subgroups of finite groups. For a nontrivial finite group $G$, we define the intersection number of $G$, denoted $\iota(G)$, to be the minimum number of maximal subgroups whose intersection equals the Frattini subgroup of $G$. We elucidate some basic properties of this invariant, and give an exact formula for $\iota(G)$ when $G$ is a nontrivial finite nilpotent group. In addition, we determine the intersection numbers of a few infinite families of non-nilpotent groups. We conclude by discussing a generalization of the intersection number of a nontrivial finite group and pose some open questions about these invariants.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper defines the intersection number ι(G) for a nontrivial finite group G as the minimum number of maximal subgroups whose intersection equals the Frattini subgroup Φ(G). It states an exact formula for ι(G) when G is nilpotent (derived from the primary decomposition into Sylow subgroups), computes ι(G) explicitly for several infinite families of non-nilpotent groups, discusses a generalization of the invariant, and poses open questions.

Significance. If the stated formula holds, the work introduces a well-defined dual invariant to the covering number σ(G) and supplies an exact, parameter-free expression for all nontrivial finite nilpotent groups via their Sylow decomposition; this is a clear strength. The explicit computations for non-nilpotent families provide concrete data points that can be checked directly against the definition.

minor comments (2)
  1. [Abstract] Abstract: the claim that an exact formula is given for nilpotent groups is not accompanied by even a brief statement of the formula itself; adding one sentence summarizing the formula would make the abstract self-contained.
  2. The generalization section and open questions would benefit from explicit cross-references to the earlier definitions of ι(G) and the nilpotent formula to clarify how the generalization extends the main results.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our work and the recommendation of minor revision. The referee's description of the paper is accurate. No specific major comments are listed in the report, so we have no point-by-point responses to provide. We will incorporate any minor editorial corrections in the revised version.

Circularity Check

0 steps flagged

No significant circularity; definition and formulas are independent

full rationale

The paper introduces ι(G) as a freshly defined minimum (the smallest number of maximal subgroups intersecting exactly to the standard Frattini subgroup Φ(G)). The exact formula for nilpotent groups is derived from the primary decomposition G = P1 × ⋯ × Pr together with the correspondence of maximal subgroups to those in the Sylow factors; this is a direct group-theoretic computation, not a reduction to fitted parameters or self-citations. Results for the listed non-nilpotent families are explicit computations. No load-bearing step matches any of the enumerated circularity patterns; the central claims rest on external standard theorems about Φ(G) and Sylow structure rather than on the paper's own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper rests on the standard fact that Φ(G) is the intersection of all maximal subgroups; no free parameters are fitted and no new entities are postulated.

axioms (1)
  • domain assumption The Frattini subgroup Φ(G) equals the intersection of all maximal subgroups of any finite group G.
    This classical theorem is required for the definition of ι(G) to be meaningful as the minimal number of maximal subgroups achieving exactly that intersection.

pith-pipeline@v0.9.0 · 5691 in / 1216 out tokens · 21656 ms · 2026-05-25T01:47:19.926700+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages · 3 internal anchors

  1. [1]

    Abdollahi, F

    A. Abdollahi, F. Ashraf, and S. M. Shaker. The symmetric group o f degree six can be covered by 13 and no fewer proper subgroups. Bull. Malays. Math. Sci. Soc. (2) , 30(1):57–58, 2007

  2. [2]

    Bruckheimer, A

    M. Bruckheimer, A. C. Bryan, and A. Muir. Groups as the union of three subgroups. Am Math Mon. , 77(1):52–58, 1970

  3. [3]

    R. A. Bryce, V. Fedri, and L. Serena. Subgroup coverings of so me linear groups. Bull. Austral. Math. Soc., 60(2):227–238, 1999

  4. [4]

    Burness, Martino Garonzi, and Andrea Lucchini

    Timothy C. Burness, Martino Garonzi, and Andrea Lucchini. On th e minimal dimension of a finite simple group. arXiv:1903.09607v1, March 2019

  5. [5]

    J. H. E. Cohn. On n-sum groups. Math. Scand. , 75:44–58, 1994

  6. [6]

    On the structure of primitive n-sum groups

    Eloisa Detomi and Andrea Lucchini. On the structure of primitive n-sum groups. Cubo, 10(3):195–210, 2008

  7. [7]

    Magliveras

    Michael Epstein and Spyros S. Magliveras. The covering number o f M24. J. Algebra Comb. Discrete Appl., 3(3):155–158, 2016

  8. [8]

    On an Inequality of Dimension-like Invariants for Finite Groups

    Ravi Fernando. On an inequality of dimension-like invariants for fin ite groups. arXiv:1502.00360v1, Feb 2015

  9. [9]

    Covering monolithic groups with proper subgrou p

    Martino Garonzi. Covering monolithic groups with proper subgrou p. Int. J. Group Theory, 2(1):131–144, 2013

  10. [10]

    Finite groups that are the union of at most 25 p roper subgroups

    Martino Garonzi. Finite groups that are the union of at most 25 p roper subgroups. J. Algebra Appl. , 12(4):1350002, 2013

  11. [11]

    On integers that are covering numbers of groups

    Martino Garonzi, Luise-Charlotte Kappe, and Eric Swartz. On in tegers that are covering numbers of groups. https://arxiv.org/abs/1805.09047, November 2018

  12. [12]

    Maximal irredundant families of minimal size in the alternating group

    Martino Garonzi and Andrea Lucchini. Maximal irredundant fam ilies of minimal size in the alternating group. arXiv:1808.04387v2, April 2019

  13. [13]

    Groups as unions of prop er subgroups

    Seymour Haber and Azriel Rosenfeld. Groups as unions of prop er subgroups. Am Math Mon. , 66(6):491– 494, 1959

  14. [14]

    P. E. Holmes. Subgroup coverings of some sporadic groups. J. Combin. Theory Ser. A , 113:1204–1213, 2006

  15. [15]

    On the covering number of small symmetric groups and some sporadic simple groups

    Luise-Charlotte Kappe, Daniela Nikolova-Popova, and Eric Swar tz. On the covering number of small symmetric groups and some sporadic simple groups. Groups Complexity Cryptology, 8(2):135–154, 2016

  16. [16]

    Lauderdale

    L.-K. Lauderdale. Lower bounds on the number of maximal subg roups in a finite group. Arch. Math. , 101(1):9–15, 2013

  17. [17]

    Liebeck, Cheryl E

    Martin W. Liebeck, Cheryl E. Praeger, and Jan Saxl. On the O’Na n-Scott theorem for finite primitive permutation groups. J. Austral. Math Soc. (Series A) , 44:389–396, 1988

  18. [18]

    M. S. Lucido. On the covers of finite groups. In Groups St. Andrews, volume 305 of London Mathematical Society Lecture Note Series , pages 395–399. Cambridge University Press, 2003

  19. [19]

    Covering the symmetric group with proper subgr oups

    Attila Mar´ oti. Covering the symmetric group with proper subgr oups. J. Combin. Theory Ser. A , 110(1):97–111, 2005

  20. [20]

    On the covering number of S14

    Ryan Oppenheim and Eric Swartz. On the covering number of S14. Involve, 12(1):89–96, 2019

  21. [21]

    G. Scorza. I gruppi che possono pensasi come soma di tre lor o sottogruppi. Boll. Un. Mat. Ital. , 5:216– 218, 1926

  22. [22]

    Leonard L. Scott. Representations in characteristic p. In Proc. of Sympos. in Pure Math. , volume 37, pages 318–331, Providence, RI, 1980. Santa Cruz conference o n finite groups, Amer. Math. Soc

  23. [23]

    On the covering number of symmetric groups havin g degree divisible by six

    Eric Swartz. On the covering number of symmetric groups havin g degree divisible by six. Discrete Math., 339(11):2593–2604, 2016

  24. [24]

    M. J. Tomkinson. Groups as the union of proper subgroups. Math. Scand. , 81:191–198, 1997