A class of infinite convex geometries

zbMATH Open1338.52002arXiv1501.04174MaRDI QIDQ276205FDOQ276205

Authors: J. B. Nation, Kira Adaricheva 

Publication date: 3 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes of examples of such convex geometries are given.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The theory of convex geometries
• Antimatroids of finite character
• scientific article; zbMATH DE number 1154598
• Convex geometries
• On the representation of finite convex geometries with convex sets

zbMATH Keywords

anti-exchange propertyclosure systemconvex geometryjoin semidistributive lattice

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Continuous lattices and posets, applications (06B35) Discrete geometry (52C99) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Cites Work

• The theory of convex geometries
• Lattice varieties covering the smallest non-modular variety
• Canonical decompositions in complete lattices
• The core of finite lattices
• Lattices of suborders
• Jónsson's contributions to lattice theory
• The lattice of convex subsemilattices of a semilattice
• On scattered convex geometries
• Join-semidistributive lattices and convex geometries.
• Representing finite convex geometries by relatively convex sets
• Classes of Semidistributive Lattices
• Decomposition Theory for Lattices Without Chain Conditions
• Finite Sublattices of a Free Lattice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semidistributive and coalgebraic lattices of subsemilattices
• A use for frequently rediscovering a concept
• Application of the join-irreducible excess function to semi-modular lattices

Cited In (10)

• Pruning processes and a new characterization of convex geometries
• Infinite serie of extreme Delaunay polytopes
• Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries
• On scattered convex geometries
• Resolutions of convex geometries
• Title not available (Why is that?)
• Infinite series of extreme Delaunay polytopes
• Title not available (Why is that?)
• A discrete duality between nonmonotonic consequence relations and convex geometries
• Title not available (Why is that?)

This page was built for publication: A class of infinite convex geometries

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