No label defined (Q4510683)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1522338
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1522338

      Statements

      0 references
      9 January 2001
      0 references
      oligomorphic permutation groups
      0 references
      numbers of orbits
      0 references
      integer sequences
      0 references
      A permutation group \(G\) on a countably infinite set \(X\) is oligomorphic if for each positive integer \(k\) it has finitely many orbits in its induced action on \(k\)-sets. An oligomorphic permutation group \((G,X)\) gives rise to two integer sequences: namely, \((f_k(G))\), where \(f_k(G)\) is the number of orbits on unordered \(k\)-element subsets of \(X\), and \((F_k(G))\), which enumerates the orbits on ordered \(k\)-sets (of distinct elements). Many well-known combinatorial sequences arise as \((f_k(G))\) or \((F_k(G))\) for some such \((G,X)\), and the author attempts here to document this. New sequences arise from old ones by taking point stabilisers, direct products, or wreath products, and the author describes how such sequences are related. The Fraïssé Amalgamation Theorem from model theory provides many further examples. Given an oligomorphic permutation group \((G,X)\) there is an associated graded algebra \(A^G\) such that the dimension of the \(k\)-th homogeneous component is \(f_k(G)\). Often, \(A^G\) turns out to be a polynomial algebra. In this case, the inverse Euler transformation takes \(f_k(G)\) to the number of generators of degree \(k\). Hence, an approach to proving \(A^G\) is a polynomial algebra is to apply the inverse Euler transformation to the sequence \((f_k(G))\), and attempt to identify the resulting sequence \((a_k(G))\) combinatorially. One expects that \(f_k(G)\) counts the number of unlabelled \(k\)-element structures in some class, and that \(a_k(G)\) counts the number of `connected' \(k\)-element members of the class (with respect to some notion of connectedness). The paper concludes with tables of known combinatorial sequences arising as \((f_k(G))\), \((F_k(G))\), or \((a_k(G))\) for some oligomorphic group \((G,X)\).
      0 references

      Identifiers