Symmetry groups of Boolean functions.

DOI10.1016/J.EJC.2014.01.011MaRDI QIDQ402450zbMATH OpenOpenAlexFDO

Authors Mariusz Grech, Andrzej Kisielewicz

Publication date 28 August 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.1290

zbMATH Keywords

Boolean functionsregular permutation groupssymmetry groups

Mathematics Subject Classification ID

Boolean functions (06E30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Subgroups of symmetric groups (20B35)

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.

Recommendations

• Regular symmetric groups of Boolean functions.
• Symmetry groups of Boolean functions and constructions of permutation groups
• Almost all Boolean functions have no linear symmetries
• Linear symmetries of Boolean functions.
• Results on permutation symmetric Boolean functions

Cites work

• Boolean Functions, Invariance Groups, and Parallel Complexity
• Finite digraphs with given regular automorphism groups
• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• scientific article; zbMATH DE number 192892 (Why is no real title available?)
• scientific article; zbMATH DE number 556252 (Why is no real title available?)
• scientific article; zbMATH DE number 953683 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• On graphical representations of cyclic extensions of groups
• On the non-existence of graphs with transitive generalized dicyclic groups
• Orbit equivalence and permutation groups defined by unordered relations.
• Permutation groups defined by unordered relations.
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Regular symmetric groups of Boolean functions.
• Supergraphs and graphical complexity of permutation groups.
• Symmetry groups of Boolean functions and constructions of permutation groups

Cited in

(17)

• Almost all Boolean functions have no linear symmetries
• Orbits of Boolean functions
• Symmetry groups of Boolean functions and constructions of permutation groups
• Invariance groups of functions and related Galois connections
• Abelian permutation groups with graphical representations
• Graphical representations of cyclic permutation groups
• Linear symmetries of Boolean functions.
• Boolean Functions, Invariance Groups, and Parallel Complexity
• The stabilizers of certain families of Boolean functions of n variables that form a Galois-closed subalgebra of the Schaefer algebra. II
• Results on permutation symmetric Boolean functions
• scientific article; zbMATH DE number 709442 (Why is no real title available?)
• Content and singletons bring unique identification minors
• Matrix characterization of symmetry groups of Boolean functions
• Wreath product in automorphism groups of graphs
• Orbit closed permutation groups, relation groups, and simple groups
• Symmetry groups for social preference functions
• Regular symmetric groups of Boolean functions.

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)