$k$th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to study the nonvanishing flats of Boolean functions. This approach allows us to determine the number of nonvanishing flats for an infinite family of Boolean functions. We moreover use it to show that any $k$th-order sum-free $(n,n)$-function of algebraic degree $k$ gives rise to an $(n-k)$th-order sum-free $(n,n)$-function of algebraic degree $n-k$. This implies the existence of millions of $(n-2)$th-order sum-free functions.