✦ LIBER ✦

An upper bound for the minimum diameter of integral point sets

✍ Scribed by Heiko Harborth; Arnfried Kemnitz; Meinhard Möller

Publisher: Springer
Year: 1993
Tongue: English
Weight: 243 KB
Volume: 9
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02189331

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the diameter of a pol

An upper bound for the diameter of a polytope

✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d

An upper bound for the minimum rank of a

An upper bound for the minimum rank of a graph

✍ Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 137 KB

An Upper-Bound theorem for families of c

An Upper-Bound theorem for families of convex sets

✍ Jürgen Eckhoff 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 470 KB

An upper bound on the number of planarK-

An upper bound on the number of planarK-sets

✍ János Pach; William Steiger; Endre Szemerédi 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 746 KB

An upper bound for the minimum weight of

An upper bound for the minimum weight of dual codes of Figueroa planes

✍ J. D. Key; M. J. de Resmini 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 91 KB

An Upper Bound for the Size of Integral

An Upper Bound for the Size of Integral Solutions to Ym=ƒ(X)

✍ P.M. Voutier 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 739 KB

In this paper, we establish improved upper bounds on the size of integral solutions to hyper- and super-elliptic equations under the conditions of LeVeque (Acta. Arith. IX (1964), 209-219). The proof follows the classical argument of Siegel (J. London Math. Soc. 1 (1926), 66-68), using upper bounds