Optimum basis of finite convex geometry

DOI10.1016/j.dam.2017.06.009zbMath1423.06012arXiv1205.3236OpenAlexW2963533754MaRDI QIDQ2399285

K. V. Adaricheva

Publication date: 22 August 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convex geometrycanonical basissupersolvable latticeaffine convex geometrysystem of implicationsminimum basisacyclic Horn Boolean functionsanti-exchange closure operatorHorn rules of antimatroidminimum CNF-representationminimum representations of acyclic hypergraphsoptimum basis

Mathematics Subject Classification ID

Axiomatic and generalized convexity (52A01) Boolean functions (06E30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items

Notes on join semidistributive lattices, A representation of antimatroids by Horn rules and its application to educational systems, What convex geometries tell about shattering-extremal systems, The joy of implications, aka pure Horn formulas: mainly a survey, A modular characterization of supersolvable lattices, Translating between the representations of a ranked convex geometry, On implicational bases of closure systems with unique critical sets., Quasi-closed elements in fuzzy posets, Enumerating maximal consistent closed sets in closure systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subclass of Horn CNFs optimally compressible in polynomial time
• On implicational bases of closure systems with unique critical sets.
• Semidistributive and coalgebraic lattices of subsemilattices
• A use for frequently rediscovering a concept
• The multiple facets of the canonical direct unit implicational basis
• The sorting order on a Coxeter group.
• Realization of abstract convex geometries by point configurations
• The theory of convex geometries
• A circuit set characterization of antimatroids
• The core of finite lattices
• Two embedding theorems for lower bounded lattices
• A theory of finite closure spaces based on implications
• Join-semidistributive lattices and convex geometries.
• EL-labelings, supersolvability and 0-Hecke algebra actions on posets
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Ordered direct implicational basis of a finite closure system
• The prime stems of rooted circuits of closure spaces and minimum implicational bases
• A representation of antimatroids by Horn rules and its application to educational systems
• Representing finite convex geometries by relatively convex sets
• Supersolvable lattices
• Lattices of regular closed subsets of closure spaces
• Finite Sublattices of a Free Lattice
• Minimum Covers in Relational Database Model
• Optimal implicational bases for finite modular lattices