In this paper we study a notion of a ฮบ-covering set in connection with Bernstein sets and other types of nonmeasurability. Our results correspond to those obtained by Muthuvel in [7] and Nowik in [8]. We consider also other types of coverings.
Hyperplane coverings and blocking sets
โ Scribed by Aiden A. Bruen; Joseph Adolphe Thas
- Publisher
- Springer-Verlag
- Year
- 1982
- Tongue
- French
- Weight
- 135 KB
- Volume
- 181
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Large sets of packings were investigated extensively. Much less is known about the dual problem, Le., large sets of coverings. We examine two types of important questions in this context; what is the maximum number of disjoint optimal coverings? and what is the minimum number of optimal coverings fo
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