Cospanning characterizations of violator and co-violator spaces
Yulia Kempner, Vadim E. Levit

TL;DR
This paper explores the relationships between violator and co-violator spaces, introducing new properties and characterizations that deepen understanding of their structure and interconnections in combinatorial optimization.
Contribution
It introduces co-violator spaces based on contracting operators and provides cospanning characterizations that reveal new properties and interrelations of violator and co-violator operators.
Findings
Uniquely generated violator spaces have Krein-Milman properties.
Cospanning characterizations lead to new insights into violator and co-violator operators.
The paper establishes interconnections between violator and co-violator spaces.
Abstract
Given a finite set E and an operator sigma:2^{E}-->2^{E}, two subsets X,Y of the ground set E are cospanning if sigma(X)=sigma(Y) (Korte, Lovasz, Schrader; 1991). We investigate cospanning relations on violator spaces. A notion of a violator space was introduced in (Gartner, Matousek, Rust, Skovrovn; 2008) as a combinatorial framework that encompasses linear programming and other geometric optimization problems. Violator spaces are defined by violator operators. We introduce co-violator spaces based on contracting operators known also as choice functions. Let alpha,beta:2^{E}-->2^{E} be a violator operator and a co-violator operator, respectively. Cospanning characterizations of violator spaces allow us to obtain some new properties of violator operators, co-violator operators, and their interconnections. In particular, we show that uniquely generated violator spaces enjoy so-called…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques · Complexity and Algorithms in Graphs
