Translating between the representations of a ranked convex geometry

07/22/2019
by   Oscar Defrain, et al.
0

It is well known that every closure system can be represented by an implicational base, or by the set of its meet-irreducible elements. In Horn logic, these are respectively known as the Horn expressions and the characteristic models. In this paper, we consider the problem of translating between the two representations in acyclic convex geometries. Quite surprisingly, we show that the problem in this context is already harder than the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem for which the existence of an output quasi-polynomial time algorithm is open. In light of this result, we consider a proper subclass of acyclic convex geometries, namely ranked convex geometries, as those that admit a ranked implicational base analogous to that of ranked posets. For this class, we provide output quasi-polynomial time algorithms based on hypergraph dualization for translating between the two representations. This improves the understanding of a long-standing open problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2022

The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases

We study the well-known problem of translating between two representatio...
research
02/18/2020

Representations for the largest Extension of a closure system

We consider extension of a closure system on a finite set S as a closure...
research
03/24/2020

Deep Weisfeiler Leman

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...
research
07/13/2021

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

Finding a homomorphism from some hypergraph 𝒬 (or some relational struct...
research
05/03/2018

On the Enumeration of Minimal Hitting Sets in Lexicographical Order

It is a long-standing open problem whether there exists an output-polyno...
research
11/15/2019

Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles

The weighted T-free 2-matching problem is the following problem: given a...

Please sign up or login with your details

Forgot password? Click here to reset