𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on geometric permutations for convex sets

✍ Scribed by Rephael Wenger


Publisher
Springer
Year
1990
Tongue
English
Weight
408 KB
Volume
5
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Geometric permutations for convex sets
✍ M Katchalski; T Lewis; J Zaks πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 657 KB
Geometric permutations of disjoint trans
✍ 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.

Bounds for linear functionals on convex
✍ Walter Roth πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 187 KB

## Abstract We consider continuous monotone linear functionals on a locally convex ordered topological vector space that are sandwiched between a given \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$(\mathbb R\cup \lbrace +\infty \rbrace )$\end{document}‐valued subline