Universal Affine Classification of Boolean Functions

In this paper we advance a practical solution of the classification problem of Boolean functions by the affine group – the largest group of linear transformations of variables. We show that the affine types (equivalence classes) can be arranged in a unique infinite sequence which contains all previous lists of types. The types are specified by their minimal representatives, spectral invariants, and stabilizer orders. A brief survey of the fundamental transformation groups is included.