2005
DOI: 10.1016/j.comgeo.2004.05.001
|View full text |Cite
|
Sign up to set email alerts
|

The affine representation theorem for abstract convex geometries

Abstract: A convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which captures a combinatorial essence of "convexity" shared by some objects including finite point sets, partially ordered sets, trees, rooted graphs. In this paper, we introduce a generalized convex shelling, and show that every convex geometry can be represented as a generalized convex shelling. This is "the representation theorem for convex geometries" analogous to "the representation theorem for oriented matroids" by Fol… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
37
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(37 citation statements)
references
References 16 publications
0
37
0
Order By: Relevance
“…In this paper we provide an alternate proof of this representation theorem using a representation of [7] which represents a convex geometry through a collection of orderings. An important feature of this new proof is that it yields an upper bound on the dimension of the smallest Euclidean space into which a convex geometry may be embedded via a generalized convex shelling which may be different to the upper bound found by [13]. We then further use the representation theorem of [7] to provide a new result, that any convex geometry may be embedded as convex polygons in R 2 .…”
Section: Introductionmentioning
confidence: 94%
“…In this paper we provide an alternate proof of this representation theorem using a representation of [7] which represents a convex geometry through a collection of orderings. An important feature of this new proof is that it yields an upper bound on the dimension of the smallest Euclidean space into which a convex geometry may be embedded via a generalized convex shelling which may be different to the upper bound found by [13]. We then further use the representation theorem of [7] to provide a new result, that any convex geometry may be embedded as convex polygons in R 2 .…”
Section: Introductionmentioning
confidence: 94%
“…Note that most of the finite convex geometries are not isomorphic to any of these restrictions. The first result that represents every finite convex geometry with the help of R n ; Conv R n was proved in Kashiwabara, Nakamura, and Okamoto [13]. This result uses auxiliary points and has not much to do with restrictions in our sense, so we do not give further details on it.…”
Section: Introductionmentioning
confidence: 99%
“…Lower bounded lattices play an important role in lattice theory, especially in the study of free lattices, see monograph R. Freese, J. Ježek and J.B. Nation [12]. Finally, it was shown by K. Kashiwabara, M. Nakamura and Y. Okamoto [13] that every finite convex geometry is a sub-geometry of some affine convex geometry in R n , solving Problem 1.2 in the positive.…”
Section: Introductionmentioning
confidence: 99%