Correlation between Karnaugh-map patterns and Chow parameters for 3-variable linearly separable (threshold) functions

Abstract

All possible linearly separable Boolean functions may be geometrically characterised by certain patterns on Karnaugh-map layouts, or mathematically characterised by the magnitude of their Chow parameters. Correlation between these two characterisations is shown to be that the Karnaugh-map patterns represent all possible permutations of the Chow parameters.