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

[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.