Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0411244

Coverings of abelian groups and vector spaces

Balazs Szegedy
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many cosets we need, if we want to cover all but one element of an Abelian group. This result is a group theoretical extension of the theorem of Brouwer, Jamison and Schrijver about the blocking number of an affine space. We show that these covering problems are closely related to combinatorial problems, including the so called additive basis conjecture, the three-flow conjecture, and a conjecture of Alon, Jaeger and Tarsi about nowhere zero vectors.

Explore related subjects

math.GRmath.CO

Keep this discovery

BibTeXRIS

Balazs Szegedy. 2004-11-11. Coverings of abelian groups and vector spaces. https://arxiv.org/abs/math/0411244

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗