3 papers
cs.CC2025
Compression with wildcards: All models of a Boolean 2-CNF
Marcel Wild
Let be a finite set which simultaneously serves as the universe of any poset and as the vertex set of any graph . Our algorithm, abbreviated A-I-I, enumerates…
math.CO2024
Enumerating all minimal hitting sets in polynomial total time
Marcel Wild
Consider a hypergraph (=set system) whose hyperedges are subsets of a set with w elements. We show that the minimal hitting sets of can be enumera…
math.CO2024
Modular lattices of finite length (Part A)
Marcel Wild
This is Part A of four Parts dedicated to modular lattices of finite length. It builds on 1992 notes of the author (available on ResearchGate), and in so doing heeds a wish of the…