Representation of convex geometries by circles on the plane

DOI10.1016/J.DISC.2018.10.043zbMATH Open1409.52001arXiv1609.00092OpenAlexW2963937081WikidataQ128843695 ScholiaQ128843695MaRDI QIDQ1712517FDOQ1712517

Kira Adaricheva, M. Bolat

Publication date: 22 January 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the result of K. Kashiwabara, M.Nakamura and Y.Okamoto (2005). Allowing circles rather than points, as was suggested by G.Cz'edli (2014), may presumably reduce the dimension for representation. This paper introduces a property, the Weak $2imes3$-Carousel rule, which is satisfied by all convex geometries of circles on a plane, and we show that it does not hold in all finite convex geometries. This raises a number of representation problems for convex geometries, which may allow us to better understand the properties of Euclidean space related to its dimension.

Full work available at URL: https://arxiv.org/abs/1609.00092

zbMATH Keywords

closure systemconvex geometryconvex dimensionaffine convex geometryWeak \(2 \times 3\)-Carousel rule

Mathematics Subject Classification ID

Axiomatic and generalized convexity (52A01)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The theory of convex geometries
• Join-semidistributive lattices and convex geometries.
• Representing finite convex geometries by relatively convex sets
• A use for frequently rediscovering a concept
• Finite convex geometries of circles
• Realization of abstract convex geometries by point configurations
• The joy of implications, aka pure Horn formulas: mainly a survey
• Embedding convex geometries and a bound on convex dimension
• Sublattices of Lattices of Convex Subsets of Vector Spaces
• The affine representation theorem for abstract convex geometries
• Characterizing circles by a convex combinatorial property
• On characterizing collections arising from N-gons in the plane
• On the representation of finite convex geometries with convex sets
• Bases of Closure Systems
• Representing convex geometries by almost-circles
• Regular systems of paths and families of convex sets in convex position
• An easy way to a theorem of Kira Adaricheva and Madina Bolat on convexity and circles

Cited In (6)

• Slim patch lattices as absolute retracts and maximal lattices
• CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE
• Absolute retracts for finite distributive lattices and slim semimodular lattices
• A convex combinatorial property of compact sets in the plane and its roots in lattice theory
• Convex geometries representable by at most five circles on the plane
• Convexity in ordered matroids and the generalized external order

Recommendations

• Representing finite convex geometries by relatively convex sets 👍 👎
• Finite convex geometries of circles 👍 👎
• Circle geometry in affine Cayley-Klein planes 👍 👎
• Circle configurations in strictly convex normed planes 👍 👎
• Characterizing circles by a convex combinatorial property 👍 👎
• On the representation of finite convex geometries with convex sets 👍 👎
• Representing convex geometries by almost-circles 👍 👎
• Euclidean cones over circles 👍 👎
• Circles and crossing planar compact convex sets 👍 👎

This page was built for publication: Representation of convex geometries by circles on the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1712517)