CPC
2011
13 years 5 months ago
2011
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.
RECOMB
2010
Springer
13 years 9 months ago
2010
Springer
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...
DCG
2006
13 years 11 months ago
2006
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...
ENDM
2008
13 years 11 months ago
2008
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 ...