English

Representing convex geometries by almost-circles

Combinatorics 2016-08-24 v1

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 TrrT_{rr} of planar convex polygons such that TrrT_{rr} with respect to geometric convex hulls is a locally convex geometry and every finite convex geometry can be represented by restricting the structure of TrrT_{rr} to a finite subset in a natural way. An \emph{almost-circle of accuracy} 1ϵ1-\epsilon is a differentiable convex simple closed curve SS in the plane having an inscribed circle of radius r1>0r_1>0 and a circumscribed circle of radius r2r_2 such that the ratio r1/r2r_1/r_2 is at least 1ϵ1-\epsilon. % Motivated by Richter and Rogers' result, we construct a set TnewT_{new} such that (1) TnewT_{new} 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) TnewT_{new} with respect to the geometric convex hull operator is a locally convex geometry; (3) as opposed to TrrT_{rr}, TnewT_{new} is closed with respect to non-degenerate affine transformations; and (4) for every (small) positive ϵ\epsilon\in\real and for every finite convex geometry, there are continuum many pairwise affine-disjoint finite subsets EE of TnewT_{new} such that each EE consists of almost-circles of accuracy 1ϵ1-\epsilon and the convex geometry in question is represented by restricting the convex hull operator to EE. The affine-disjointness of E1E_1 and E2E_2 means that, in addition to E1E2=E_1\cap E_2=\emptyset, even ψ(E1)\psi(E_1) is disjoint from E2E_2 for every non-degenerate affine transformation ψ\psi.

Keywords

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

R2 v1 2026-06-22T15:28:09.540Z