Finite convex geometries of circles
From MaRDI portal
Publication:2017059
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3960418 (Why is no real title available?)
- scientific article; zbMATH DE number 4093521 (Why is no real title available?)
- scientific article; zbMATH DE number 3724452 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 1313604 (Why is no real title available?)
- scientific article; zbMATH DE number 2070395 (Why is no real title available?)
- scientific article; zbMATH DE number 2159636 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A use for frequently rediscovering a concept
- Application of the join-irreducible excess function to semi-modular lattices
- Composition series in groups and the structure of slim semimodular lattices.
- Congruence lattices and cover-preserving embeddings of finite length semimodular lattices. I
- Coordinatization of finite join-distributive lattices.
- Every finite lattice can be embedded in a finite partition lattice
- How many ways can two composition series intersect?
- Join-semidistributive lattices and convex geometries.
- Lattice Theory: Foundation
- Lattices with unique irreducible decompositions
- Meet-distributive lattices and the anti-exchange closure
- Notes on planar semimodular lattices. I. Construction
- Notes on planar semimodular lattices. III. Rectangular lattices
- Notes on planar semimodular lattices. IV. The size of a minimal congruence lattice representation with rectangular lattices
- Notes on planar semimodular lattices. VII: Resections of planar semimodular lattices
- On lattices of convex sets in \(\mathbb R^n\)
- On the number of slim, semimodular lattices
- Planar Lattices
- Representing finite convex geometries by relatively convex sets
- Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices
- Slim semimodular lattices. I. A visual approach
- Slim semimodular lattices. II: A description by patchwork systems
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices
- The affine representation theorem for abstract convex geometries
- The geometry of the chamber system of a semimodular lattice
- The matrix of a slim semimodular lattice
- The sorting order on a Coxeter group.
- The theory of convex geometries
- \(n\)-distributivity, dimension and Carathéodory's theorem
Cited in
(21)- CD-independent subsets in meet-distributive lattices.
- Diagrams and rectangular extensions of planar semimodular 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
- On the geometry of the smallest circle enclosing a finite set of points
- Convex Geometries on Root Systems
- CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE
- The theory of convex geometries
- Absolute retracts for finite distributive lattices and slim semimodular lattices
- Quasiplanar diagrams and slim semimodular lattices
- Convex geometries representable with colors, by ellipses on the plane, and impossible by circles
- A new property of congruence lattices of slim, planar, semimodular lattices
- On slim rectangular lattices
- Patch extensions and trajectory colorings of slim rectangular lattices.
- scientific article; zbMATH DE number 1098778 (Why is no real title available?)
- 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)