On the compounding of higher order monotonic pseudo-Boolean functions

Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page long formulas. We give an easier proof of a more general result, exploiting known properties of higher order monotonic functions.