Add to ORKGAbstract. We prove that the maximum number of geometric permutations, induced by line transversals to a collection of n pairwise disjoint balls in R d,is�(n d−1). This improves substantially the upper bound of O(n 2d−2) known for general convex sets [9]. We show that the maximum number of geometric permutations of a sufficiently large collection of pairwise disjoint unit disks in the plane is two, improving the previous upper bound of three given in [5]
AbstractWe introduce a new notion of ‘neighbors’ in geometric permutations. We conjecture that the m...
AbstractWe show that a set of n disjoint unit spheres in Rd admits at most two distinct geometric pe...
AbstractA geometric permutation is the pair of permutations formed by a common transversal for a fin...
We prove that the maximum number of geometric permutations, induced by line transversals to a collec...
AbstractIn this paper, we prove that the maximum number of geometric permutations (induced by line t...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
AbstractWe introduce a new notion of ‘neighbors’ in geometric permutations. We conjecture that the m...
AbstractWe study combinatorial bounds for geometric permutations of balls with bounded size disparit...
http://www.elsevier.com/locate/comgeoWe show that a set of $n$ disjoint unit spheres in $R^d$ admits...
AbstractWe show that a set of n disjoint unit spheres in Rd admits at most two distinct geometric pe...
AbstractWe introduce a new notion of ‘neighbors’ in geometric permutations. We conjecture that the m...
AbstractWe show that a set of n disjoint unit spheres in Rd admits at most two distinct geometric pe...
AbstractA geometric permutation is the pair of permutations formed by a common transversal for a fin...
We prove that the maximum number of geometric permutations, induced by line transversals to a collec...
AbstractIn this paper, we prove that the maximum number of geometric permutations (induced by line t...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
We show that a set of n disjoint unit spheres in R d admits at most two distinct geometric permutati...
AbstractWe introduce a new notion of ‘neighbors’ in geometric permutations. We conjecture that the m...
AbstractWe study combinatorial bounds for geometric permutations of balls with bounded size disparit...
http://www.elsevier.com/locate/comgeoWe show that a set of $n$ disjoint unit spheres in $R^d$ admits...
AbstractWe show that a set of n disjoint unit spheres in Rd admits at most two distinct geometric pe...
AbstractWe introduce a new notion of ‘neighbors’ in geometric permutations. We conjecture that the m...
AbstractWe show that a set of n disjoint unit spheres in Rd admits at most two distinct geometric pe...
AbstractA geometric permutation is the pair of permutations formed by a common transversal for a fin...