Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915865085083648 |
|---|---|
| author | Meunier, Anthony Nourine, Lhouari Vilmin, Simon |
| author_facet | Meunier, Anthony Nourine, Lhouari Vilmin, Simon |
| contents | 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 task is known to be hard in general but tractable for a number of classes of closure systems. In particular, several classes of convex geometries are known to have tractable optimization, while the problem was recently claimed to remain hard in general convex geometries. Continuing this line of research, we give a characterization of the optimum bases of a convex geometry in terms of what we call quasi-closed hypergraphs. We then use this characterization to show that when each quasi-closed hypergraph has disjoint edges, any implicational base of the convex geometry can be optimized in polynomial time with existing minimization and reduction algorithms. Finally, we prove that this property applies to double-shelling, acyclic, affine and acceptant convex geometries, thus unifying the existing results regarding the tractability of optimization for the first three classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14615 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs Meunier, Anthony Nourine, Lhouari Vilmin, Simon Combinatorics Discrete Mathematics 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 task is known to be hard in general but tractable for a number of classes of closure systems. In particular, several classes of convex geometries are known to have tractable optimization, while the problem was recently claimed to remain hard in general convex geometries. Continuing this line of research, we give a characterization of the optimum bases of a convex geometry in terms of what we call quasi-closed hypergraphs. We then use this characterization to show that when each quasi-closed hypergraph has disjoint edges, any implicational base of the convex geometry can be optimized in polynomial time with existing minimization and reduction algorithms. Finally, we prove that this property applies to double-shelling, acyclic, affine and acceptant convex geometries, thus unifying the existing results regarding the tractability of optimization for the first three classes. |
| title | Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2603.14615 |