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 int...
The thesis focuses on two open problems on finite partially ordered sets: the structure of order pol...
Given P and P', equally sized planar point sets in general position, we call a bijection from P to P...
According to the classical Erdős–Szekeres theorem, every sufficiently large set of points in general...
We apply ideas from the theory of limits of dense combinatorial structures to study order types, whi...
International audienceThe notion of limits of dense graphs was invented, among other reasons, to att...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
This thesis is focused on problems related to the theory of combinatorial limits.This theory opened ...
Cette thèse traite de problèmes liés à la théorie des limitesd'objets combinatoires, une récente thé...
We establish the following two main results on order types of points in general position in the plan...
AbstractGoodman and Pollack have asked to estimate the probabilities of order types by using a unifo...
For a class of graph instances of a computational problem we define a limit object, relative to some...
For A, a finite set of points in Rd , let ∆(A) denote the spread of A and be equal to the ratio of t...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
We study several problems in extremal combinatorics, random graphs, and asymptotic convex geometry. ...
This thesis consists of three main topics in which we explore the geometry and other features of cer...
The thesis focuses on two open problems on finite partially ordered sets: the structure of order pol...
Given P and P', equally sized planar point sets in general position, we call a bijection from P to P...
According to the classical Erdős–Szekeres theorem, every sufficiently large set of points in general...
We apply ideas from the theory of limits of dense combinatorial structures to study order types, whi...
International audienceThe notion of limits of dense graphs was invented, among other reasons, to att...
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extrem...
This thesis is focused on problems related to the theory of combinatorial limits.This theory opened ...
Cette thèse traite de problèmes liés à la théorie des limitesd'objets combinatoires, une récente thé...
We establish the following two main results on order types of points in general position in the plan...
AbstractGoodman and Pollack have asked to estimate the probabilities of order types by using a unifo...
For a class of graph instances of a computational problem we define a limit object, relative to some...
For A, a finite set of points in Rd , let ∆(A) denote the spread of A and be equal to the ratio of t...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
We study several problems in extremal combinatorics, random graphs, and asymptotic convex geometry. ...
This thesis consists of three main topics in which we explore the geometry and other features of cer...
The thesis focuses on two open problems on finite partially ordered sets: the structure of order pol...
Given P and P', equally sized planar point sets in general position, we call a bijection from P to P...
According to the classical Erdős–Szekeres theorem, every sufficiently large set of points in general...