Sciweavers

DCG
2006
97views more  DCG 2006»
13 years 4 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...
DAM
2006
66views more  DAM 2006»
13 years 4 months ago
Positivity of second order linear recurrent sequences
We give an elementary proof for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun-1 + bun-2 has ...
Vesa Halava, Tero Harju, Mika Hirvensalo
CPM
2004
Springer
138views Combinatorics» more  CPM 2004»
13 years 9 months ago
Reversal Distance without Hurdles and Fortresses
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
Anne Bergeron, Julia Mixtacki, Jens Stoye