Paper detail

Finite convex geometries of circles

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.

preprint2013arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.