Small Blocking Sets in Higher Dimensions

Tamás Szonyi, Zsuzsa Weiner

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

We show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyperplane in 1 modulo p points, where q=ph. The result is then extended to blocking sets with respect to k-dimensional subspaces and, at least when p>2, to intersections with arbitrary subspaces not just hyperplanes. This can also be used to characterize certain non-degenerate blocking sets in higher dimensions. Furthermore we determine the possible sizes of small minimal blocking sets with respect to k-dimensional subspaces.

Original languageEnglish
Pages (from-to)88-101
Number of pages14
JournalJournal of Combinatorial Theory. Series A
Volume95
Issue number1
DOIs
Publication statusPublished - Jul 1 2001

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Small Blocking Sets in Higher Dimensions'. Together they form a unique fingerprint.

  • Cite this