Longest convex chains
نویسندگان
چکیده
Assume Xn is a random sample of n uniform, independent points from a triangle T . The longest convex chain, Y , of Xn is defined naturally (see the next paragraph). The length |Y | of Y is a random variable, denoted by Ln. In this paper we determine the order of magnitude of the expectation of Ln. We show further that Ln is highly concentrated around its mean, and that the longest convex chains have a limit shape.
منابع مشابه
Longest Convex Chains*b
Assume Xn is a random sample of n uniform, independent points from a triangle T . The longest convex chain, Y , of Xn is defined naturally (see the next paragraph). The length |Y | of Y is a random variable, denoted by Ln. In this article, we determine the order of magnitude of the expectation of Ln. We show further that Ln is highly concentrated around its mean, and that the longest convex cha...
متن کاملar X iv : 0 90 6 . 54 52 v 1 [ m at h . PR ] 3 0 Ju n 20 09 LONGEST CONVEX CHAINS
Assume Xn is a random sample of n uniform, independent points from a triangle T . The longest convex chain, Y , of Xn is defined naturally (see the next paragraph). The length |Y | of Y is a random variable, denoted by Ln. In this paper we determine the order of magnitude of the expectation of Ln. We show further that Ln is highly concentrated around its mean, and that the longest convex chains...
متن کاملLongest convex lattice chains
Let T be a triangle with two specified vertices v0, v1 ∈ Z2. A convex lattice chain in T from v0 to v1 is defined naturally (see the next paragraph). In this paper we prove what the maximal length of a convex lattice chain is if the area of T is fixed (and large). It is also shown that the solution is unique apart from lattice preserving affine transformations.
متن کاملBounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted, and respectively non-weighted, common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect matchings, spanning trees, spanning cycles (tours), and triangulations. (i) We present a new lower bound construction for the maximum number of triangulations a set ...
متن کاملAnalytic and Probabilistic Problems in Discrete Geometry
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence u1, . . . , un of norm 1 vectors in a real Hilbert space H , there exists a unit vector v ∈ H , such that X 1 〈ui, v〉2 6 n . The 2-dimensional case is proved b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 35 شماره
صفحات -
تاریخ انتشار 2009