20 citations · 76 across the 28 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2011
The diminishing segment process
Gergely Ambrus, Péter Kevei, Viktor Vígh
Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) i…
math.PR2009★ 5 cited
Longest convex chains
Gergely Ambrus, Imre Barany
Assume is a random sample of uniform, independent points from a triangle . The longest convex chain, , of is defined naturally. The length of is a r…