Description:
<jats:p>Multiplicative cut sparsifiers, introduced by Benczúr and Karger [STOC’96], have proved extremely influential and found various applications. Precise characterisations were established for sparsifiability of graphs with other 2-variable predicates on Boolean domains by Filtser and Krauthgamer [SIDMA’17] and non-Boolean domains by Butti and Živný [SIDMA’20].</jats:p>
<jats:p>Bansal, Svensson and Trevisan [FOCS’19] introduced a weaker notion of sparsification termed “additive sparsification”, which does not require weights on the edges of the graph. In particular, Bansal et al. designed algorithms for additive sparsifiers for cuts in graphs and hypergraphs.</jats:p>
<jats:p>
As our main result, we establish that
<jats:italic>all</jats:italic>
Boolean Constraint Satisfaction Problems (CSPs) admit an additive sparsifier; that is, for every Boolean predicate
<jats:italic>P</jats:italic>
:{ 0,1}
<jats:sup>
<jats:italic>k</jats:italic>
</jats:sup>
→ { 0,1} of a fixed arity
<jats:italic>k</jats:italic>
, we show that CSP(
<jats:italic>P</jats:italic>
) admits an additive sparsifier. Under our newly introduced notion of all-but-one sparsification for non-Boolean predicates, we show that CSP(
<jats:italic>P</jats:italic>
) admits an additive sparsifier for
<jats:italic>any</jats:italic>
predicate
<jats:italic>P</jats:italic>
:
<jats:italic>D</jats:italic>
<jats:sup>
<jats:italic>k</jats:italic>
</jats:sup>
→ { 0,1} of a fixed arity
<jats:italic>k</jats:italic>
on an arbitrary finite domain
<jats:italic>D</jats:italic>
.
</jats:p>