Showing math.COShow all
3 papers · 1 filter
math.CO2026
Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
Anthony Meunier, Lhouari Nourine, Simon Vilmin
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This tas…
math.CO2026
Generating minimal redundant and maximal irredundant sets in incidence graphs
Emanuel Castelo, Jérémie Chalopin, Oscar Defrain +1
It has been proved by Boros and Makino that there is no output-polynomial-time algorithm enumerating the minimal redundant sets or the maximal irredundant sets of a hypergraph, unl…
math.CO2025
On the -base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
Kira Adaricheva, Simon Vilmin
Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits mult…