## Abstract Let __S__ be a blocking set in an inversive plane of order __q__. It was shown by Bruen and Rothschild 1 that |__S__| ≥ 2__q__ for __q__ ≥ 9. We prove that if __q__ is sufficiently large, __C__ is a fixed natural number and |__S__ = 2__q__ + __C__, then roughly 2/3 of the circles of the
Note on disjoint blocking sets in Galois planes
✍ Scribed by János Barát; Stefano Marcugini; Fernanda Pambianco; Tamás Szőnyi
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 118 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this paper, we show that there are at least cq disjoint blocking sets in PG(2,q), where c ≈ 1/3. The result also extends to some non‐Desarguesian planes of order q. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 149–158, 2006
📜 SIMILAR VOLUMES
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
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
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.
Intersection sets and blocking sets play an important role in contemporary finite geometry. There are cryptographic applications depending on their construction and combinatorial properties. This paper contributes to this topic by answering the question: how many circles of an inversive plane will b
In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li