Permutation groups on unordered sets. II: On a theorem of Frucht

DOI10.1016/0012-365X(93)90073-3MaRDI QIDQ685555zbMATH OpenOpenAlexFDO

Authors Johannes Siemons

Publication date 14 August 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90073-3

zbMATH Keywords

\(k\)-geometric permutation group\(k\)-geometricallyautomorphism groups of block geometriesblocksfaithful permutation representationFrucht number

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) General theory for finite permutation groups (20B05) Multiply transitive infinite groups (20B22) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Infinite automorphism groups (20B27)

Review text

[Part I, Arch. Math. 43, 483-487 (1984; Zbl 0547.20001).] A permutation group \((G,\Omega)\) on a finite or infinite set \(\Omega\) acts \(k\)-geometrically if there is a system \(B\) of \(k\)-element subsets of \(\Omega\) (called blocks) such that a permutation of \(\Omega\) belongs to \(G\) if and only if it maps blocks onto blocks. The main result of the paper is Theorem 1: Let \(G\) be a group and \(k \geq 2\) an integer. Then there is a faithful permutation representation of \(G\) on some set \(\Omega\) such that \((G,\Omega)\) acts \(k\)-geometrically. This theorem generalizes an old theorem of Frucht about the representability of an abstract group as the full automorphism group of a graph (case \(k = 2\)). Let the \(k\)th Frucht number \(f_ k(G)\) of a finite group \(G\) be the minimal cardinality of a set \(\Omega\) on which \(G\) can be represented faithfully as a \(k\)-geometric permutation group. Theorem 2 of the paper gives some bounding relations between the various Frucht numbers \(f_ k(G)\) of a group \(G\) which is not isomorphic to a symmetric group or to the direct product of two symmetric groups.

Recommendations

• scientific article; zbMATH DE number 4053878
• Direct product of automorphism groups of colored graphs
• The classification of minimal graphs with given abelian automorphism group
• Graph representation of permutation groups. I.
• Direct product and uniqueness of automorphism groups of graphs
• Publication:3496347
• Symmetry groups of Boolean functions and constructions of permutation groups
• Rank three permutation groups with rank three subconstituents
• Graphical complexity of products of permutation groups

Cites work

• scientific article; zbMATH DE number 3031989 (Why is no real title available?)
• On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
• Regular sets and geometric groups
• Regular sets for the affine and projective groups over the field of two elements
• The classification of minimal graphs with given abelian automorphism group
• The faithful linear representations of least degree of S_n and A_n over a field of characteristic 2.

Cited in

(3)

• Symmetry groups of Boolean functions and constructions of permutation groups
• Frucht's theorem for the digraph factorial
• Frucht's theorem in Borel setting

This page was built for publication: Permutation groups on unordered sets. II: On a theorem of Frucht

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685555)