paper

Normal covering numbers for and and additive combinatorics

arXiv:2410.06999 · doi:10.1112/blms.70154

Abstract

The normal covering number of a finite group is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for and depending on the arithmetic structure of . In particular we determine the limsups over and over the sequences of even and odd integers, as well as the liminf of over even integers. In general we explain how the values of and are related to problems in additive combinatorics. These results answer most of the questions posed by Bubboloni, Praeger, and Spiga as Problem 20.17 of the Kourovka Notebook.

arXiv comment20pp. To appear in Bulletin of the London Mathematical Society

References in corpus (5)