Representing convex geometries by almost-circles
Abstract
Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set of planar convex polygons such that with respect to geometric convex hulls is a locally convex geometry and every finite convex geometry can be represented by restricting the structure of to a finite subset in a natural way. An \emph{almost-circle of accuracy} is a differentiable convex simple closed curve in the plane having an inscribed circle of radius and a circumscribed circle of radius such that the ratio is at least . % Motivated by Richter and Rogers' result, we construct a set such that (1) contains all points of the plane as degenerate singleton circles and all of its non-singleton members are differentiable convex simple closed planar curves; (2) with respect to the geometric convex hull operator is a locally convex geometry; (3) as opposed to , is closed with respect to non-degenerate affine transformations; and (4) for every (small) positive and for every finite convex geometry, there are continuum many pairwise affine-disjoint finite subsets of such that each consists of almost-circles of accuracy and the convex geometry in question is represented by restricting the convex hull operator to . The affine-disjointness of and means that, in addition to , even is disjoint from for every non-degenerate affine transformation .
Cite
@article{arxiv.1608.06550,
title = {Representing convex geometries by almost-circles},
author = {Gábor Czédli and János Kincses},
journal= {arXiv preprint arXiv:1608.06550},
year = {2016}
}
Comments
18 pages, 6 figures