Finite convex geometries of circles

DOI10.1016/J.DISC.2014.04.017zbMATH Open1295.52004arXiv1212.3456OpenAlexW2046751904MaRDI QIDQ2017059FDOQ2017059

Authors: Gábor Czédli 

Publication date: 25 June 2014

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

Abstract: Let F be a finite set of circles in the plane. We point out that the usual convex closure restricted to F yields a convex geometry, that is, a combinatorial structure introduced by P. H Edelman in 1980 under the name "anti-exchange closure system". We prove that if the circles are collinear and they are arranged in a "concave way", then they determine a convex geometry of convex dimension at most 2, and each finite convex geometry of convex dimension at most 2 can be represented this way. The proof uses some recent results from Lattice Theory, and some of the auxiliary statements on lattices or convex geometries could be of separate interest. The paper is concluded with some open problems.

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

Recommendations

• Representation of convex geometries by circles on the plane
• On the representation of finite convex geometries with convex sets
• The theory of convex geometries
• Description of closure operators in convex geometries of segments on the line
• Representing convex geometries by almost-circles

zbMATH Keywords

anti-exchange propertyconvex geometryplanar latticelower semimodular latticegeometry of circles

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Axiomatic and generalized convexity (52A01)

Cites Work

• Lattice Theory: Foundation
• 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
• Application of the join-irreducible excess function to semi-modular lattices
• Title not available (Why is that?)
• Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices
• A decomposition theorem for partially ordered sets
• The sorting order on a Coxeter group.
• The geometry of the chamber system of a semimodular lattice
• Slim semimodular lattices. I. A visual approach
• How many ways can two composition series intersect?
• Coordinatization of finite join-distributive lattices.
• Slim semimodular lattices. II: A description by patchwork systems
• Lattices with unique irreducible decompositions
• On the number of slim, semimodular lattices
• Composition series in groups and the structure of slim semimodular lattices.
• Notes on planar semimodular lattices. IV. The size of a minimal congruence lattice representation with rectangular lattices
• Congruence lattices and cover-preserving embeddings of finite length semimodular lattices. I
• Notes on planar semimodular lattices. I. Construction
• Notes on planar semimodular lattices. III. Rectangular lattices
• Notes on planar semimodular lattices. VII: Resections of planar semimodular lattices
• Title not available (Why is that?)
• Planar Lattices
• Title not available (Why is that?)
• The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
• The matrix of a slim semimodular lattice
• Meet-distributive lattices and the anti-exchange closure
• Every finite lattice can be embedded in a finite partition lattice
• Title not available (Why is that?)
• The affine representation theorem for abstract convex geometries
• On lattices of convex sets in \(\mathbb R^n\)
• Title not available (Why is that?)
• \(n\)-distributivity, dimension and Carathéodory's theorem
• Title not available (Why is that?)

Cited In (21)

• Diagrams and rectangular extensions of planar semimodular lattices
• CD-independent subsets in meet-distributive lattices.
• Slim patch lattices as absolute retracts and maximal lattices
• Description of closure operators in convex geometries of segments on the line
• Representing convex geometries by almost-circles
• Convex Geometries on Root Systems
• On the geometry of the smallest circle enclosing a finite set of points
• CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE
• The theory of convex geometries
• Absolute retracts for finite distributive lattices and slim semimodular lattices
• Convex geometries representable with colors, by ellipses on the plane, and impossible by circles
• Quasiplanar diagrams and slim semimodular lattices
• A new property of congruence lattices of slim, planar, semimodular lattices
• On slim rectangular lattices
• Patch extensions and trajectory colorings of slim rectangular lattices.
• Title not available (Why is that?)
• A convex combinatorial property of compact sets in the plane and its roots in lattice theory
• Embedding convex geometries and a bound on convex dimension
• Convex geometries representable by at most five circles on the plane
• Representation of convex geometries by circles on the plane
• On the number of atoms in three-generated lattices

This page was built for publication: Finite convex geometries of circles

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