The affine representation theorem for abstract convex geometries

DOI10.1016/j.comgeo.2004.05.001zbMath1113.52002OpenAlexW1970147436WikidataQ56387985 ScholiaQ56387985MaRDI QIDQ705549

Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto

Publication date: 31 January 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.05.001

zbMATH Keywords

generalized convex shelling

Mathematics Subject Classification ID

Axiomatic and generalized convexity (52A01) Oriented matroids in discrete geometry (52C40)

Related Items

Essentiality and convexity in the ranking of opportunity sets ⋮ Notes on join semidistributive lattices ⋮ A convex combinatorial property of compact sets in the plane and its roots in lattice theory ⋮ Resolutions of convex geometries ⋮ A discrete duality between nonmonotonic consequence relations and convex geometries ⋮ CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE ⋮ Representation of convex geometries by circles on the plane ⋮ Local topology of the free complex of a two-dimensional generalized convex shelling ⋮ Antimatroids induced by matchings ⋮ Impartial achievement games on convex geometries ⋮ Embedding convex geometries and a bound on convex dimension ⋮ The max-flow min-cut property of two-dimensional affine convex geometries ⋮ Finite convex geometries of circles ⋮ Realization of abstract convex geometries by point configurations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroids and antimatroids - a survey
• Greedoids
• Local topology of the free complex of a two-dimensional generalized convex shelling
• The theory of convex geometries
• A circuit set characterization of antimatroids
• Oriented matroids
• Choice functions and abstract convex geometries
• A greedy algorithm for convex geometries
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Counting the interior points of a point configuration
• Dual greedy polyhedra, choice functions, and abstract convex geometries
• An algorithmic characterization of antimatroids
• Introduction to Greedoids
• Knowledge Spaces
• Oriented Matroids
• Topological representations of matroids
• Matrices and matroids for systems analysis
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
• Locally complete path independent choice functions and their lattices