𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conic blocking sets in Desarguesian projective planes

✍ Scribed by Leanne D. Holder

Publisher
Springer
Year
2004
Tongue
English
Weight
130 KB
Volume
80
Category
Article
ISSN
0047-2468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Blocking Sets in Desarguesian Affine and
Blocking Sets in Desarguesian Affine and Projective Planes
✍ TamΓ‘s SzΕ‘nyi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 237 KB

In this paper we show that blocking sets of cardinality less than 3(q Ο© 1)/2 (q Ο­ p n ) in Desarguesian projective planes intersect every line in 1 modulo p points. It is also shown that the cardinality of a blocking set must lie in a few relatively short intervals. This is similar to previous resul

RΓ©dei Blocking Sets in Finite Desarguesi
RΓ©dei Blocking Sets in Finite Desarguesian Planes
✍ B.F. Sherman πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 272 KB

The characterisation by Blokhuis, Ball, Brouwer, Storme, and SzΓΆnyi of certain kinds of blocking sets of RΓ©dei type is extended to specify the type of polynomial which defines the blocking set. A graphic characterisation called the profile of the set is also given, and the correspondence between the

Dual blocking sets in projective and aff
Dual blocking sets in projective and affine planes
✍ Peter J. Cameron; Francesco Mazzocca; Roy Meshulam πŸ“‚ Article πŸ“… 1988 πŸ› Springer 🌐 English βš– 191 KB

A dual blocking set is a set of points which meets every blocking set but contains no line. We establish a lower bound for the cardinality of such a set, and characterize sets meeting the bound, in projective and affine planes. A blocking set for a family ~-of sets is a set which meets every member

On Nuclei and Blocking Sets in Desargues
On Nuclei and Blocking Sets in Desarguesian Spaces
✍ Simeon Ball πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 89 KB

A generalisation is given to recent results concerning the possible number of nuclei to a set of points in PG(n, q). As an application of this we obtain new lower bounds on the size of a t-fold blocking set of AG(n, q) in the case (t, q)>1.