Metraipolis › archive › dc_cfc1bfaf5916

Extremal subspace covers in finite vector spaces — arXiv:2610.07051

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07051
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:01.351Z
SHA-256 of the archived text
7ef7158ad318d9c3dd8168eac8ece6ff25e4cac3c067dc75643955131f5efd9d
Stable URL of this page
https://metraipolis.com/documento/dc_cfc1bfaf5916

How to cite

Extremal subspace covers in finite vector spaces — arXiv:2610.07051 — arXiv (en), https://arxiv.org/abs/2610.07051 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cfc1bfaf5916 (Metraipolis archive dc_cfc1bfaf5916, sha256 7ef7158ad318d9c3dd8168eac8ece6ff25e4cac3c067dc75643955131f5efd9d)
BibTeX
@misc{dccfc1bfaf5916,
  title = {Extremal subspace covers in finite vector spaces — arXiv:2610.07051},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07051},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cfc1bfaf5916; sha256 7ef7158ad318d9c3dd8168eac8ece6ff25e4cac3c067dc75643955131f5efd9d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07051. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb F_q$, where $n\ge 2$. It is classical that $q+1$ proper subspaces are necessary and sufficient to cover $V$ [@Jamison1977; @Khare2009; @Clark2012]. We study extremal refinements of this covering theorem. For $1\le m\le q+1$, we determine the maximum possible size of the union of $m$ proper subspaces of $V$, proving that $$ \max_{W_1,\ldots,W_m<V} \left|W_1\cup\cdots\cup W_m\right| = q^{n-2}\bigl(1+m(q-1)\bigr). $$ We also classify all equality cases: for $m\ge 2$, equality holds precisely when the subspaces are distinct hyperplanes containing a common codimension-two subspace. As consequences, we obtain a structural classification of minimum covers of $V$ by proper subspaces and a sharp defect estimate for unions of $q$ proper subspaces. We then introduce basis-blocking families, namely families of proper subspaces whose union meets every basis of $V$. We prove that the minimum size of such a family is $q$ and classify all extremal families of this size. Finally, we establish the affine analogue and give an elementary recognition criterion for extremal families. Together, these results provide a unified extremal-combinatorial description of coverings of finite vector spaces by proper subspaces.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07051 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.528Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).