Clean tangled clutters, simplices, and projective geometries

Abdi, AhmadORCID logo; Cornuéjols, Gérard; and Superdock, Matt (2022) Clean tangled clutters, simplices, and projective geometries Journal of Combinatorial Theory, Series B, 154. 60 - 92. ISSN 0095-8956
Copy

A clutter is clean if it has no delta or the blocker of an extended odd hole minor, and it is tangled if its covering number is two and every element appears in a minimum cover. Clean tangled clutters have been instrumental in progress towards several open problems on ideal clutters, including the τ = 2 Conjecture. Let C be a clean tangled clutter. It was recently proved that C has a fractional packing of value two. Collecting the supports of all such fractional packings, we obtain what is called the core of C. The core is a duplication of the cuboid of a set of 0 1 points, called the setcore of C. In this paper, we prove three results about the setcore. First, the convex hull of the setcore is a full dimensional polytope containing the center point of the hypercube in its interior. Secondly, this polytope is a simplex if, and only if, the setcore is the cocycle space of a projective geometry over the two-element field. Finally, if this polytope is a simplex of dimension more than three, then C has the clutter of the lines of the Fano plane as a minor. Our results expose a fascinating interplay between the combinatorics and the geometry of clean tangled clutters.

picture_as_pdf

picture_as_pdf
subject
Accepted Version
Available under Creative Commons: Attribution-NonCommercial-No Derivative Works 4.0

Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads