Coverings of Abelian groups and vector spaces.
From MaRDI portal
Publication:857412
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 981680 (Why is no real title available?)
- scientific article; zbMATH DE number 682077 (Why is no real title available?)
- A nowhere-zero point in linear mappings
- Covering finite fields with cosets of subspaces
- Covering the cube by affine hyperplanes
- Groups Covered By Permutable Subsets
- Groups covered by finitely many cosets or subgroups
- The blocking number of an affine space
- The polynomial method and restricted sums of congruence classes
Cited in
(7)- Cellular covers of Abelian groups.
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- On the size of coset unions
- Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture
- Covering theory for complexes of groups.
- Covering modules by proper submodules
- COVERINGS OF LINEAR GROUPS
This page was built for publication: Coverings of Abelian groups and vector spaces.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857412)