Limits of Order Types

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erdős problem of finding the minimal density of 5-or 6-tuples in convex position in an arbitrary point set, and also an inequality expressing the difficulty of sampling order types uniformly. Next we establish results on the analytic representation of limits of order types by planar measures. Our main result is a rigidity theorem: we show that if sampling two measures induce the same probability distribution on order types, then these measures are projectively equivalent provided the support of at least one of them has non-empty interior. We also show that some condition on the Hausdorff dimension of the support is necessary to obtain projective rigidity and we construct limits of order types that cannot be represented by a planar measure. Returning to combinatorial geometry we relate the regularity of this analytic representation to the aforementioned problem of Erdős on the density of k-tuples in convex position, for large k.

[1]  Andrew Suk,et al.  On the Erdos-Szekeres convex polygon problem , 2016, ArXiv.

[2]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[3]  Jesús Leaños,et al.  A central approach to bound the number of crossings in a generalized configuration , 2008, Electron. Notes Discret. Math..

[4]  Alfredo Hubard,et al.  Realization Spaces of Arrangements of Convex Bodies , 2014, Discret. Comput. Geom..

[5]  P. Erdös,et al.  Crossing Number Problems , 1973 .

[6]  S. Janson.  Graphons, cut norm and distance, couplings and rearrangements , 2010, 1009.2376.

[7]  N. Alon.  The number of polytopes, configurations and real matroids , 1986 .

[8]  János Pach,et al.  Research problems in discrete geometry , 2005 .

[9]  B. Borchers.  CSDP, A C library for semidefinite programming , 1999 .

[10]  Jesús Leaños,et al.  On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn , 2011, Discret. Comput. Geom..

[11]  Franz Aurenhammer,et al.  Enumerating order types for small sets with applications , 2001, SCG '01.

[12]  Oswin Aichholzer,et al.  New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn , 2007, Discret. Comput. Geom..

[13]  Federico Ardila,et al.  Positively oriented matroids are realizable , 2013, 1310.4159.

[14]  George Szekeres,et al.  Computer solution to the 17-point Erdős-Szekeres problem , 2006 .

[15]  O. Nikodým.  Sur une généralisation des intégrales de M. J. Radon , 1930 .

[16]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[17]  Jorge López,et al.  Computational search of small point sets with small rectilinear crossing number , 2014, J. Graph Algorithms Appl..

[18]  J. Horton.  Sets with No Empty Convex 7-Gons , 1983, Canadian Mathematical Bulletin.

[19]  E. Steinitz.  Bedingt konvergente Reihen und konvexe Systeme. , 1913 .

[20]  Bernardo M. Ábrego,et al.  A Lower Bound for the Rectilinear Crossing Number , 2005, Graphs Comb..

[21]  Peter W. Shor,et al.  Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.

[22]  Esther E. Klein,et al.  On some extremum problems in elementary geometry , 2006 .

[23]  Svante Janson.  Standard representation of multivariate functions on a general probability space , 2007 .

[24]  Özgür Özkan,et al.  The Complexity of Order Type Isomorphism , 2013, SODA.

[25]  Yufei Zhao,et al.  On replica symmetry of large deviations in random graphs , 2012, Random Struct. Algorithms.

[26]  P. Valtr,et al.  Probability thatn random points are in convex position , 1995, Discret. Comput. Geom..

[27]  Paul Erdös,et al.  Some Old and New Problems in Combinatorial Geometry , 1984 .

[28]  E. Welzl,et al.  Convex Quadrilaterals and k-Sets , 2003 .

[29]  Alexander A. Razborov,et al.  Flag algebras , 2007, Journal of Symbolic Logic.

[30]  J. Radon.  Theorie und Anwendungen der absolut additiven Mengenfunktionen , 1913 .

[31]  Edward R. Scheinerman,et al.  The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometri , 1994 .

[32]  B. Ábrego,et al.  The Rectilinear Crossing Number of K n : Closing in (or Are We?) , 2013 .

[33]  Sam Payne,et al.  Realization Spaces for Tropical Fans , 2009, 0909.4582.

[34]  B. Borchers.  A C library for semidefinite programming , 1999 .

[35]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[36]  P. Gritzmann,et al.  Applied geometry and discrete mathematics : the Victor Klee festschrift , 1991 .

[37]  Franz Aurenhammer,et al.  Enumerating Order Types for Small Point Sets with Applications , 2002, Order.