scientific article; zbMATH DE number 782052
From MaRDI portal
Publication:4841308
Recommendations
- scientific article; zbMATH DE number 3943560
- scientific article; zbMATH DE number 3932433
- scientific article; zbMATH DE number 1303206
- scientific article; zbMATH DE number 4092769
- Polygraphic programs and polynomial-time functions
- Automating Pólya theory: The computational complexity of the cycle index polynomial
- scientific article; zbMATH DE number 125290
- scientific article; zbMATH DE number 69493
- Polynomial runtime and composability
- Algorithmic computation of polynomial amoebas
Cited in
(20)- 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]
- Quasisymmetric and Schur expansions of cycle index polynomials
- A recursion of the Pólya polynomial for the symmetric group
- Numerical algorithm for Pólya enumeration theorem
- The Polya theory and permutation groups
- On the connectivity and independence number of power graphs of groups
- Conjugacy classes in finite permutation groups via homomorphic images
- Counting the number of group orbits by marrying the Burnside process with importance sampling
- Automating Pólya theory: The computational complexity of the cycle index polynomial
- scientific article; zbMATH DE number 475376 (Why is no real title available?)
- Hahn polynomials and the Burnside process
- Perfect codes in commuting graphs of symmetric groups
- The cycle polynomial of a permutation group
- An algorithm for the multiplication of symmetric polynomials
- Graphs defined on groups
- scientific article; zbMATH DE number 4072975 (Why is no real title available?)
- On the cycle index of point groups
- Some differential properties of Pólya's cycle indicators
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)
