✦ LIBER ✦

On the distribution of distances in finite sets in the plane

✍ Scribed by K Vesztergombi

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 894 KB
Volume: 57
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90162-1

No coin nor oath required. For personal study only.

✦ Synopsis

Let n k denote the number of times the kth largest distance occurs among a set S of n points. We show that if S is the set of vertices of a convex polygone in the euclidean plane, then n1+2n2~3n and n2<~n +n 1. Together with the well-known inequality n~<~n and the trivial inequalities n~>~O and n2>~O, all linear inequalities which are valid for n, n 1 and n2 are consequences of these. Similar results are obtained for the hyperbolic plane.

📜 SIMILAR VOLUMES

The two largest distances in finite plan

The two largest distances in finite planar sets

✍ Katalin Vesztergombi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 333 KB

We determine all homogenous linear inequalities satisfied by the numbers of occurrences of the two largest distances among n points in the plane.

On ‘k-sets’ in the plane

✍ G.W. Peck 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 95 KB

Given an arrangement of n points in the plane, a k-set in the plane is a k element subset of these that can be separated from the others by a straight line. The question of how many j-sets there are with ] less than k was considered by Pach and by Goodman and Pollack [1], who obtained upper bounds o

Rigid Subanalytic Sets in the Plane

✍ H. Schoutens 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 390 KB

On the Representation of Sets in Finite

On the Representation of Sets in Finite Measure Spaces

✍ Kali P. Rath 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 109 KB

On the Cardinality of Intersection Sets

On the Cardinality of Intersection Sets in Inversive Planes

✍ Marcus Greferath; Cornelia Rößing 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 115 KB

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

On the Recursivity of Finite Sets

✍ Ronald Harrop 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 1 views

ON THE mcuitsrvm-OF FINITE SISTS by ROSALD ITARRW in Newcastle upon Tync (England) $j 1 lritrodiiclion In this paprr n n nsgcct, is discussed of tlic relationship between rccursivity aiid intuitive dccitlalilit~~ hi the case of fiiiitc sets, which, altliougli rcfcrred to elsewhere in the literatuw (