scientific article; zbMATH DE number 782052

zbMATH Open0833.20005MaRDI QIDQ4841308FDOQ4841308

Mark Jerrum

Publication date: 13 March 1996

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3943560
• scientific article; zbMATH DE number 3932433
• scientific article; zbMATH DE number 1303206
• scientific article
• Polygraphic programs and polynomial-time functions
• Automating Pólya theory: The computational complexity of the cycle index polynomial
• scientific article
• scientific article
• Polynomial runtime and composability
• Algorithmic computation of polynomial amoebas

zbMATH Keywords

symmetry groupspermutation groupsfinite alphabetsnumber of orbitsinduced actionsPólya theorycycle-index polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial identities, bijective combinatorics (05A19) Symmetric groups (20B30)

Cited In (13)

• Computation in permutation groups: Counting and randomly sampling orbits
• Polychromatic sets and its application in simulating complex objects and systems
• The derivation of cycle index ofSn^[3]
• On the connectivity and independence number of power graphs of groups
• Conjugacy classes in finite permutation groups via homomorphic images
• Hahn polynomials and the Burnside process
• Title not available (Why is that?)
• Automating Pólya theory: The computational complexity of the cycle index polynomial
• Perfect codes in commuting graphs of symmetric groups
• An algorithm for the multiplication of symmetric polynomials
• Graphs defined on groups
• Title not available (Why is that?)
• On the cycle index of point groups

This page was built for publication:

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