Covering numbers in linear algebra
From MaRDI portal
Abstract: We compute the minimal cardinality of a covering (resp. an irredundant covering) of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given.
Recommendations
Cited in
(21)- An inequality in binary vector spaces
- Polynomial table algebras and their covering numbers
- On the Gleason-Kahane-Żelazko theorem for associative algebras
- Line and plane cover numbers revisited
- Chevalley-Warning at the boundary
- Transversal numbers over subsets of linear spaces
- An upper bound for the complexity of linearized coverings in a finite field
- On minimal coset covering of solutions of a Boolean equation
- scientific article; zbMATH DE number 4044040 (Why is no real title available?)
- Squares and covering matrices
- On zeros of a polynomial in a finite grid
- On the minimal coset coverings of the set of singular and of the set of nonsingular matrices
- Covering by complements of subspaces, II
- Covering all points except one
- The covering numbers of rings
- Graded components of local cohomology modules. II
- Prime power residue and linear coverings of vector space over \(\mathbb{F}_q\)
- Polynomials with factors of the form ( x q – a ) with roots modulo every integer
- Characterizing hyperplane coverings of vector spaces over the binary field
- 2-Covering numbers of finite groups
- Vector spaces as unions of proper subspaces
This page was built for publication: Covering numbers in linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904855)
