Symmetry groups of Boolean functions and constructions of permutation groups

DOI10.1006/JABR.1997.7198zbMath0897.20001OpenAlexW2056918231MaRDI 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 groupsBoolean functionsimprimitive groupsrepresentable permutation groups

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Boolean functions (06E30) Subgroups of symmetric groups (20B35) General theory for finite permutation groups (20B05)

Related Items (20)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Symmetry groups of Boolean functions and constructions of permutation groups