Computation in permutation groups: Counting and randomly sampling orbits

MaRDI QIDQ2741175zbMATH OpenFDO

Authors Leslie Ann Goldberg

Publication date 9 September 2001

zbMATH Keywords

orbit-counting problems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 782052
• Permutation group algorithms based on partitions. I: Theory and algorithms
• scientific article; zbMATH DE number 475376
• scientific article; zbMATH DE number 77937
• scientific article; zbMATH DE number 3975175

Cited in

(5)

• On the orbits of the product of two permutations
• How fast can we compute orbits of groups?
• Monte Carlo circuits for the abelian permutation group intersection problem
• Counting and sampling \(H\)-colourings
• Hahn polynomials and the Burnside process

Describes a project that uses

Uses Software

• nauty

This page was built for publication: Computation in permutation groups: Counting and randomly sampling orbits

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