Vector spaces as unions of proper subspaces
classification
🧮 math.AC
math.CO
keywords
subspacesfinitevectorboundcodimensioncoverfieldfind
read the original abstract
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of partitioning V into subspaces.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.