Arcs, blocking sets, and minihypers
β Scribed by N. Hamada; T. Helleseth
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 608 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
A (k, n)-arc in a finite projective plane IIq of order q is a set of k points with some n but non+l collinear points where k > n and 2 < n < q. The maximum value ofk for which a (k,n)-arc exists in PG(2, q) is denoted by mn(2, q). It is well known that if n is not a divisor of q, then mn(2, q) < (n -1)q + n -3. The purpose of this paper is to improve this upper bound on m,~ (2, q) using the nonexistence of some minihypers in PG(2, q) and to characterize some minihypers in PG(t, q) where t _> 3. (~) 2000 Elsevier Science Ltd. All rights reserved.
π SIMILAR VOLUMES
## 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
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.
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