Longest k-monotone chains
From MaRDI portal
Abstract: We study higher order convexity properties of random point sets in the unit square. Given uniform i.i.d random points, we derive asymptotic estimates for the maximal number of them which are in -monotone position, subject to mild boundary conditions. Besides determining the order of magnitude of the expectation, we also prove strong concentration estimates. We provide a general framework that includes the previously studied cases of (longest increasing sequences) and (longest convex chains).
This page was built for publication: Longest k-monotone chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350119)
