Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
