Inscribable order types
The orientation of an ordered triple of points in the plane is positive if the points appear in counterclockwise order around their convex hull, negative if they appear in clockwise order, and zero if they are collinear. A pair of finite point sets \(P, Q \subset \mathbb{R}^{2}\), which we call point configurations, have the same order type if there is a bijection that preserves the orientation of each triple, and this defines an equivalence relation. An order type \(\omega\) is an equivalence class of this relation, and we say that an element of \(\omega\) realises this \(\omega\). An order type is simple if there are no collinear triples. The extreme points of a configuration \(P\) are the vertices of the convex hull of \(P\), i.e. the points of \(P\) that can be isolated by a line, and the other points of \(P\) are the interior points. We say that a configuration is inscribed if its extreme points all lie on a circle, and we say that a configuration is inscribable if it has the same order type as an inscribed configuration, otherwise we say that it is uninscribable. In the paper under review, the authors provide (presumably) the first examples of uninscribable point configurations, and they provide the smallest one, called the non-Pascal configuration.\N\NThe authors then give the following several results which are devoted to inscribable configurations.\N\NTheorem 1. Every simple order type with at most two interior points is inscribable.\N\NTheorem 2. Every simple order type with at most five extreme points is inscribable.\N\NWe say that a point configuration \(P\) is minimally uninscribable if \(P\) is not inscribable, but \((P',B')\) is always inscribable, provided that \(P'\) is a proper subset of \(P\) and \(B' \subset P'\) is a subset of the extreme points of \(P\).\N\NTheorem 3. There are infinitely many minimally uninscribable order types.
- A characterization of ideal polyhedra in hyperbolic 3-space
- About \(f\)-vectors of inscribed simplicial polytopes
- Coding and counting arrangements of pseudolines
- COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
- Combinatory analysis. Vol. 2.
- Combinatory analysis. Vols. I, II (bound in one volume)
- Convex hulls of random order types
- Convex Polytopes
- Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade.
- Enumeration of self-dual configurations
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Graph minors. XX: Wagner's conjecture
- Handbook of Enumerative Combinatorics
- How conics govern Möbius transformations
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3679856 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3223507 (Why is no real title available?)
- scientific article; zbMATH DE number 3394958 (Why is no real title available?)
- scientific article; zbMATH DE number 3024637 (Why is no real title available?)
- Lower Bounds for Approximation by Nonlinear Manifolds
- On the Betti Numbers of Real Varieties
- Oriented Matroids
- Perspectives on projective geometry. A guided tour through real and complex geometry
- Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Scribability problems for polytopes
- Six topics on inscribable polytopes
- Teilungen der Ebenen durch Geraden oder topologische Geraden
- The Missing Axiom of Matroid Theory is Lost Forever
- The number of polytopes, configurations and real matroids
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Über isoperimetrische Probleme bei konvexen Polyedern.
This page was built for publication: Inscribable order types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624174)
