SearcharxivSearch

arXiv · math/0501451

Finite covers of groups by cosets or subgroups

Abstract

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its proper subsystems does. We show that if $G$ is cyclic, or $G$ is finite and $G_1,...,G_k$ are normal Hall subgroups of $G$, then $k\geq m+f([G:\bigcap_{i=1}^kG_i])$, where $f(\prod_{t=1}^r p_t^{α_t})=\sum_{t=1}^rα_t(p_t-1)$ if $p_1,...,p_r$ are distinct primes and $α_1,...,α_r$ are nonnegative integers. When all the $a_i$ are the identity element of $G$ and all the $G_i$ are subnormal in $G$, we prove that there is a composition series from $\bigcap_{i=1}^kG_i$ to $G$ whose factors are of prime orders. The paper also includes some other results and two challenging conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhi-Wei Sun. 2006-11-09. Finite covers of groups by cosets or subgroups. https://arxiv.org/abs/math/0501451

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR