pith. sign in

arxiv: 1805.09047 · v3 · pith:HTP7CKWNnew · submitted 2018-05-23 · 🧮 math.GR

On integers that are covering numbers of groups

classification 🧮 math.GR
keywords coveringintegersnumbersgroupsnumberdetermineeverygroup
0
0 comments X
read the original abstract

The covering number of a group $G$, denoted by $\sigma(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$ or smaller are covering numbers, and we determine precisely or bound the covering number of every primitive monolithic group with a degree of primitivity at most $129$ by introducing effective new computational techniques. Furthermore, we prove that, if $\mathscr{F}_1$ is the family of finite groups $G$ such that all proper quotients of $G$ are solvable, then $\mathbb{N}-\{\sigma(G):G\in \mathscr{F}_1\}$ is infinite, which provides further evidence that infinitely many integers are not covering numbers. Finally, we prove that every integer of the form $(q^m-1)/(q-1)$, where $m\neq3$ and $q$ is a prime power, is a covering number, generalizing a result of Cohn.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Intersection Numbers of Finite Groups

    math.GR 2019-07 unverdicted novelty 6.0

    Defines intersection number ι(G) as the minimal number of maximal subgroups intersecting at Φ(G), gives exact formula for nilpotent groups and values for some non-nilpotent families.