On the compounding of higher order monotonic pseudo-Boolean functions
Combinatorics
2021-06-24 v1
Abstract
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.
Cite
@article{arxiv.2106.12221,
title = {On the compounding of higher order monotonic pseudo-Boolean functions},
author = {Paul Ressel},
journal= {arXiv preprint arXiv:2106.12221},
year = {2021}
}