Sciweavers

CPC
2011
215views Education» more  CPC 2011»
13 years 6 months ago
An Improved Bound for k-Sets in Four Dimensions
We show that the number of halving sets of a set of n points in R4 is O n4−1/18 , improving the previous bound of [9] with a simpler (albeit similar) proof.
Micha Sharir
RECOMB
2010
Springer
13 years 10 months ago
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
Jakub Kovác, Marília D. V. Braga, Je...
DCG
2006
97views more  DCG 2006»
13 years 11 months ago
k-Sets in Four Dimensions
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
Jirí Matousek, Micha Sharir, Shakhar Smorod...
ENDM
2008
81views more  ENDM 2008»
13 years 11 months ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...