Symmetry groups of Boolean functions.
From MaRDI portal
Publication:402450
DOI10.1016/J.EJC.2014.01.011zbMATH Open1302.06019arXiv1303.1290OpenAlexW2021829630MaRDI QIDQ402450FDOQ402450
Authors: Mariusz Grech, Andrzej Kisielewicz
Publication date: 28 August 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1303.1290
Recommendations
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Subgroups of symmetric groups (20B35) Boolean functions (06E30)
Cites Work
- Primitive Groups with no Regular Orbits on the Set of Subsets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orbit equivalence and permutation groups defined by unordered relations.
- Regular symmetric groups of Boolean functions.
- Finite digraphs with given regular automorphism groups
- On graphical representations of cyclic extensions of groups
- Symmetry groups of Boolean functions and constructions of permutation groups
- Supergraphs and graphical complexity of permutation groups.
- Boolean Functions, Invariance Groups, and Parallel Complexity
- Permutation groups defined by unordered relations.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the non-existence of graphs with transitive generalized dicyclic groups
Cited In (14)
- Results on permutation symmetric Boolean functions
- Regular symmetric groups of Boolean functions.
- Invariance groups of functions and related Galois connections
- Orbit closed permutation groups, relation groups, and simple groups
- Graphical representations of cyclic permutation groups
- Symmetry groups of Boolean functions and constructions of permutation groups
- Almost all Boolean functions have no linear symmetries
- The stabilizers of certain families of Boolean functions of \(n\) variables that form a Galois-closed subalgebra of the Schaefer algebra. II
- Wreath product in automorphism groups of graphs
- Abelian permutation groups with graphical representations
- Linear symmetries of Boolean functions.
- Title not available (Why is that?)
- Matrix characterization of symmetry groups of Boolean functions
- Content and singletons bring unique identification minors
This page was built for publication: Symmetry groups of Boolean functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402450)