𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Geometric permutations of disjoint translates of convex sets

✍ Scribed by M. Katchalski; T. Lewis; A. Liu

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
565 KB
Volume
65
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Geometric permutations for convex sets
Geometric permutations for convex sets
✍ M Katchalski; T Lewis; J Zaks πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 657 KB
Routing a Permutation in the Hypercube b
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths
✍ Qian-Ping Gu; Hisao Tamaki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 95 KB

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.

On disjoint sets of differences
On disjoint sets of differences
✍ P ErdΓΆs; Robert Freud πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 384 KB