Symmetry groups of Boolean Functions
Mariusz Grech, Andrzej Kisielewicz

TL;DR
This paper proves that most abelian permutation groups, including a broader class than previously known, can be realized as the symmetry groups of Boolean functions, solving a longstanding problem.
Contribution
It extends the class of groups known to be symmetry groups of Boolean functions, covering all groups contained in direct sums of regular groups.
Findings
All abelian permutation groups except known exceptions are symmetry groups of Boolean functions.
The result applies to a larger class of groups, including those in direct sums of regular groups.
This solves an open problem posed by Clote and Kranakis.
Abstract
We prove that every abelian permutation group, but known exceptions, is the symmetry group of a boolean function. This solves the problem posed in the book by Clote and Kranakis. In fact, our result is proved for a larger class of groups, namely, for all groups contained in direct sums of regular groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Limits and Structures in Graph Theory
