Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions

TL;DR

This paper presents a polynomial-size encoding for all small-value cuts in integer-valued symmetric submodular functions, enabling efficient representation and computation of such cuts.

Contribution

It introduces a polynomial-size representation for all sets with a fixed submodular function value, generalizing previous low rank structure theorems to broader connectivity functions.

Findings

Representation size is polynomial in n for fixed k.

Algorithm constructs the representation efficiently in polynomial time.

Application to polynomial-time algorithms for fixed-value cut problems.

Abstract

We study connectivity functions, that is, integer-valued symmetric submodular functions on a finite ground set attaining $0$ on the empty set. For a connectivity function $f$ on an $n$-element set $V$ and an integer $k\ge 0$, we show that the family of all sets $X\subseteq V$ with $f(X)=k$ admits a polynomial-size representation: it can be described by a list of at most $O(n^{4k})$ items, each consisting of a set to be included, another set to be excluded, and a partition of remaining elements, such that the union of some members of the partition and the set to be included are precisely all sets $X$ with $f(X)=k$. We also give an algorithm that constructs this representation in time $O(n^{2k+7}\gamma+n^{2k+8}+n^{4k+2})$, where $\gamma$ is the oracle time to evaluate $f$. This generalizes the low rank structure theorem of Boja\'nczyk, Pilipczuk, Przybyszewski, Soko{\l}owski, and Stamoulis [Low rank MSO, arXiv, 2025] on cut-rank functions on graphs to general connectivity functions. As an application, for fixed $k$, we obtain a polynomial-time algorithm for finding a set $A$ with $f(A)=k$ and a prescribed cardinality constraint on $A$.