Symmetry groups of Boolean functions and constructions of permutation groups

DOI10.1006/jabr.1997.7198zbMath0897.20001MaRDI QIDQ1378434

Andrzej P. Kisielewicz

Publication date: 9 August 1998

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jabr.1997.7198

zbMATH Keywords

symmetry groups; Boolean functions; imprimitive groups; representable permutation groups

Mathematics Subject Classification ID

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

06E30: Boolean functions

20B35: Subgroups of symmetric groups

20B05: General theory for finite permutation groups

Related Items

CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS, Wreath product in automorphism groups of graphs, Orbit closed permutation groups, relation groups, and simple groups, Symmetry groups of Boolean functions., Totally symmetric functions are reconstructible from identification minors, Orbit equivalence and permutation groups defined by unordered relations., Regular symmetric groups of Boolean functions., Cut approach to invariance groups of lattice-valued functions, Direct product of automorphism groups of colored graphs, Permutability class of a semigroup, Invariance groups of functions and related Galois connections, Abelian permutation groups with graphical representations, Invariance groups of finite functions and orbit equivalence of permutation groups., Cyclic permutation groups that are automorphism groups of graphs, Graphical representations of cyclic permutation groups, Linear symmetries of Boolean functions., Graphical complexity of products of permutation groups, Totally symmetric colored graphs

Cites Work

• On Lovász' lattice reduction and the nearest lattice point problem
• Almost all Boolean functions have no linear symmetries
• Direct product and uniqueness of automorphism groups of graphs
• Characterization of \(p_ n\)-sequences for nonidempotent algebras
• Essential arities of term operations in finite algebras
• Idempotent algebras with log-linear free spectra
• Boolean Functions, Invariance Groups, and Parallel Complexity
• Finite Permutation Groups and Finite Simple Groups
• A Construction for Vertex-Transitive Graphs
• Set-Transitive Permutation Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item