Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 152 tok/s Pro
GPT OSS 120B 325 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

On integers that are covering numbers of groups (1805.09047v3)

Published 23 May 2018 in math.GR

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 $(qm-1)/(q-1)$, where $m\neq3$ and $q$ is a prime power, is a covering number, generalizing a result of Cohn.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.