✦ LIBER ✦

Lattices with few distances

✍ Scribed by J.H. Conway; N.J.A. Sloane

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 699 KB
Volume: 39
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(91)90035-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattice diagrams with few slopes

✍ Jurek Czyzowicz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Directed Distances with Derivatives

✍ E. Gonzalezvelasco; J. Grahameagle 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

Modules with few types

✍ Ivo Herzog 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Trees with very few eigenvalues

✍ Robert A. Beezer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

## Abstract The number of distinct eigenvalues of the adjacency matrix of a graph is bounded below by the diameter of the graph plus one. Many graphs that achieve this lower bound exhibit much symmetry, for example, distance‐transitive and distance‐regular graphs. Here we provide a recursive constr

Love With A Few Hairs

✍ Mohammed Mrabet, Paul Bowles 📂 Fiction 📅 1986 🏛 City Lights Publishers 🌐 en-US ⚖ 65 KB 👁 2 views

Bichromatic Lines with Few Points

✍ János Pach; Rom Pinchasi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Given a set of n blue and n red points in the plane, not all on a line, it is shown that there exists a bichromatic line passing through at most two blue points and at most two red points. There does not necessarily exist a line passing through precisely one blue and one red point. This result is ex