Symmetry groups of Boolean functions and constructions of permutation groups
DOI10.1006/JABR.1997.7198zbMATH Open0897.20001OpenAlexW2056918231MaRDI QIDQ1378434FDOQ1378434
Authors: Andrzej 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
Recommendations
- Regular symmetric groups of Boolean functions.
- scientific article; zbMATH DE number 4055863
- ON PERMUTATION GROUPS AND PARTITIONS
- scientific article; zbMATH DE number 61082
- Symmetry groups of Boolean functions.
- The existential transversal property: a generalization of homogeneity and its impact on semigroups
- Permutation groups on unordered sets. II: On a theorem of Frucht
- \(t\)-representability of maximal subgroups of symmetric groups
- Über die reellen Kollineationsgruppen, die der symmetrischen oder der alternierenden Gruppe isomorph sind.
- Maximal Subgroups of Infinite Symmetric Groups
General theory for finite permutation groups (20B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Subgroups of symmetric groups (20B35) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite Permutation Groups and Finite Simple Groups
- On Lovász' lattice reduction and the nearest lattice point problem
- A Construction for Vertex-Transitive Graphs
- Essential arities of term operations in finite algebras
- Title not available (Why is that?)
- Boolean Functions, Invariance Groups, and Parallel Complexity
- Title not available (Why is that?)
- Set-Transitive Permutation Groups
- Title not available (Why is that?)
- Direct product and uniqueness of automorphism groups of graphs
- Almost all Boolean functions have no linear symmetries
- Idempotent algebras with log-linear free spectra
- Characterization of \(p_ n\)-sequences for nonidempotent algebras
- Title not available (Why is that?)
Cited In (19)
- Symmetry groups of Boolean functions.
- Permutation groups on unordered sets. II: On a theorem of Frucht
- Regular symmetric groups of Boolean functions.
- Invariance groups of functions and related Galois connections
- Orbit closed permutation groups, relation groups, and simple groups
- Totally symmetric colored graphs
- Cyclic permutation groups that are automorphism groups of graphs
- Graphical representations of cyclic permutation groups
- Orbit equivalence and permutation groups defined by unordered relations.
- Wreath product in automorphism groups of graphs
- Graphical complexity of products of permutation groups
- Abelian permutation groups with graphical representations
- Linear symmetries of Boolean functions.
- Invariance groups of finite functions and orbit equivalence of permutation groups.
- Symmetries, graph properties, and quantum speedups
- Direct product of automorphism groups of colored graphs
- Cut approach to invariance groups of lattice-valued functions
- Permutability class of a semigroup
- Content and singletons bring unique identification minors
This page was built for publication: Symmetry groups of Boolean functions and constructions of permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378434)