✦ LIBER ✦

Quasiregular two-distance sets

✍ Scribed by J.J Seidel

Publisher: Elsevier Science
Year: 1969
Weight: 332 KB
Volume: 72
Category: Article
ISSN: 1385-7258
DOI: 10.1016/1385-7258(69)90026-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The distance between two convex sets

✍ Achiya Dax 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Maximum distance between two sets of poi

Maximum distance between two sets of points in Ed

✍ Jean-Marc Robert 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 199 KB

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.

Discrepancy and distance between sets

✍ Gerald Myerson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Distance graphs with missing multiples i

Distance graphs with missing multiples in the distance sets

✍ Liu, Daphne D.-F.; Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 3 views

Given positive integers m, k, and s with m > ks, let D m,k,s represent the set {1, 2, . . . , m} -{k, 2k, . . . , sk}. The distance graph G(Z, D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| ∈ D m,k,s . The chromatic number and the fractional chromatic number

Efficient algorithms for computing the m

Efficient algorithms for computing the maximum distance between two finite planar sets

✍ Binay K Bhattacharya; Godfried T Toussaint 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 822 KB