{"paper":{"title":"A characterization of maximal inhomogeneous-quadratic-free sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felipe Serrano, Gonzalo Mu\\~noz, Joseph Paat","submitted_at":"2026-05-28T21:49:26Z","abstract_excerpt":"The intersection cut framework is a versatile tool for generating valid inequalities in optimization. Its main ingredients are so-called $S$-free sets: convex sets whose interiors do not intersect a given set $S$. Among these, inclusion-wise maximal $S$-free sets are particularly important, as they yield the strongest intersection cuts. In the integer programming setting, maximal lattice-free sets are well studied and admit explicit characterizations. In the quadratic optimization context, Mu\\~noz, Paat, and Serrano (2025) characterized maximal $S$-free sets when $S$ is defined by a homogeneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30602","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.30602/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}