No label defined (Q3726894)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3958110
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3958110

      Statements

      0 references
      0 references
      1986
      0 references
      n-fold t-blocking set in PG(r,q) or AG(r,q)
      0 references
      [For the entire collection see Zbl 0582.00008.] A blocking set of an incidence structure \(\mathcal I=(\mathfrak P,\mathcal L,I)\) is a set \(B\) of points such that any element of \(\mathcal L\) contains a point of \(B\) and a point off \(B\). An \(n\)-fold blocking set of \(\mathcal I\) is a set \(\mathfrak B=\{B_1, B_2, \ldots, B_n\}\) of \(n\) mutually disjoint blocking sets of \(\mathfrak P\). Let \(\Sigma\) be a projective or affine space. A set \(B\) of \(\Sigma\) is said a \(t\)-blocking set if any \(t\)-dimensional subspace of \(\Sigma\) contains at least a point of \(B\) and a point of \(\Sigma\setminus B\). A set \(\mathfrak B=\{B_1, \ldots, B_n\}\) of \(n\) mutually disjoint \(t\)-blocking sets is said to be an \(n\)-fold \(t\)-blocking set of \(\Sigma\). The paper deals with the maximal number \(n\) of components of an \(n\)-fold \(t\)-blocking set in \(\mathrm{PG}(r,q)\) or \(\mathrm{AG}(r,q)\). The upper and lower bounds for this maximal number are proved and examples of \(n\)-fold blocking sets are constructed.
      0 references

      Identifiers