Some counting problems related to permutation groups

DOI10.1016/S0012-365X(00)00148-5MaRDI QIDQ1591139zbMATH OpenFDO

Authors Peter J. Cameron

Publication date 20 April 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00148-5

zbMATH Keywords

infinite permutation grouporbit

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) General theory for infinite permutation groups (20B07)

Review text

This paper gives a survey on problems of counting the orbits of an infinite permutation group on \(n\)-sets and \(n\)-tuples, making special emphasis on the connections of those problems.

Cited in

(9)

• Permutation groups with small orbit growth
• A survey of homogeneous structures
• An exact algorithm for the minimum quartet tree cost problem
• Generalization of convolution and incidence algebras
• Counting Certain Pairings in Arbitrary Groups
• When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• On the moments of torsion points modulo primes and their applications
• The morphology of infinite tournaments; application to the growth of their profile

This page was built for publication: Some counting problems related to permutation groups

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