𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Cardinality of Intersection Sets in Inversive Planes

✍ Scribed by Marcus Greferath; Cornelia Rößing

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
115 KB
Volume
100
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

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 be blocked by a d-element set of points that has successively been constructed using a greedy type algorithm? We derive a lower bound for this number and thus obtain an upper bound for the cardinality of an intersection set of smallest size. Defining a coefficient called greedy index, we finally give an asymptotic analysis for the blocking capabilities of circles and subplanes of inversive planes.

📜 SIMILAR VOLUMES

On blocking sets of inversive planes
On blocking sets of inversive planes
✍ György Kiss; Stefano Marcugini; Fernanda Pambianco 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB

## 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

Minimal Diameter of Certain Sets in the
Minimal Diameter of Certain Sets in the Plane
✍ András Bezdek; Ferenc Fodor 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

We investigate the problem of finding the smallest diameter D(n) of a set of n points such that all the mutual distances between them are at least 1. The asymptotic behaviour of D(n) is known; the exact value of D(n) can be easily found up to 6 points. Bateman and Erdo s proved that D(7)=2. In this

Families of Finite Sets in which No Inte
Families of Finite Sets in which No Intersection of ℓ Sets Is Covered by the Union of s Others
✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (