Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1833075

From MaRDI portal
Publication:4780503
Jump to:navigation, search

zbMATH Open1022.51009MaRDI QIDQ4780503FDOQ4780503


Authors: Pompeo Polito, Olga Polverino Edit this on Wikidata


Publication date: 21 October 2003



Title of this publication is not available (Why is that?)



Recommendations

  • On linear blocking sets in \(PG(2,q^{t})\)
  • Blocking sets of size \(q^t + q^{t-1} + 1\)
  • A small minimal blocking set in \(\mathrm{PG}(n,p^t)\), spanning a \((t-1)\)-space, is linear
  • Small point sets of \(\text{PG}(n, q ^{3})\) intersecting each \(k\)-subspace in 1 mod \(q\) points
  • On large minimal blocking sets in PG(2,q)


zbMATH Keywords

\(\text{GF}(q)\)-linear blocking setssmall minimal blocking sets


Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21)



Cited In (10)

  • Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
  • Title not available (Why is that?)
  • On small blocking sets and their linearity
  • On cutting blocking sets and their codes
  • Blocking subspaces by lines in \(PG(n,q)\)
  • Linear sets on the projective line with complementary weights
  • On linear blocking sets in \(PG(2,q^{t})\)
  • Blocking sets in line Grassmannians
  • \(\mathbb F _q\)-linear blocking sets in \(PG(2,q^4)\)
  • On linear sets of minimum size





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780503)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4780503&oldid=19077008"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 00:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki