✦ LIBER ✦

Geometric permutations for convex sets

✍ Scribed by M Katchalski; T Lewis; J Zaks

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 657 KB
Volume: 54
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90111-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometric permutations of disjoint trans

Geometric permutations of disjoint translates of convex sets

✍ M. Katchalski; T. Lewis; A. Liu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 565 KB

The object of this paper is to study how many essentially different common transversals a family of convex sets on the plane can have. In particular we consider the case where the family consists of pairwise disjoint translates of a single convex set.

Inequalities for probability contents of

Inequalities for probability contents of convex sets via geometric average

✍ Moshe Shaked; Y.L Tong 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Powers of Chords for Convex Sets

✍ Dr. sc. K. Voss 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

Lp metrics for compact, convex sets

✍ Richard A Vitale 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Convexity for set-valued maps

✍ D. Kuroiwa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The Adaption Problem for Nonsymmetric Co

The Adaption Problem for Nonsymmetric Convex Sets

✍ E. Novak 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 329 KB

We study the problem of optimal recovery in the case of a nonsymmetric convex class of functions. We compare adaptive and nonadaptive methods and prove a bound on how much better adaptive methods can be. We use new inequalities between Gelfand widths and Bernstein widths and new relations between th