## Abstract The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when __q__ is a square. Here the bound is improved if __q__ is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐p
Linear (q+1)-fold Blocking Sets in PG(2, q4)
✍ Scribed by Simeon Ball; Aart Blokhuis; Michel Lavrauw
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 109 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In a previous paper 1, all point sets of minimum size in __PG__(2,__q__), blocking all external lines to a given irreducible conic ${\cal C}$, have been determined for every odd __q__. Here we obtain a similar classification for those point sets of minimum size, which meet every externa
## Abstract We determine the distribution of quadruple systems among the orbits of 4‐element subsets under the action of PSL(2,q) on the projective line when __q__ ≡ 1 (mod 4). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 339–351, 2003; Published online in Wiley InterScience (www.interscienc
## Abstract We detected a unique de novo complex chromosome rearrangement (CCR) in a patient with multiple abnormalities including growth retardation, facial anomalies, exudative vitreoretinopathy (EVR), cleft palate, and minor digital anomalies. Cytogenetic analysis, fluorescent in situ hybridizat