An algorithm for the multiplication of symmetric polynomials
From MaRDI portal
cycle index polynomialfigure counting serieshigher degrees of symmetryinteger partitionsmultiplication of symmetric polynomialspermutation groupPólya enumerationsymbolic algebra
Software, source code, etc. for problems pertaining to combinatorics (05-04) Exact enumeration problems, generating functions (05A15) Software, source code, etc. for problems pertaining to field theory (12-04) Discrete mathematics in relation to computer science (68R99) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(9)- Automating Pólya theory: The computational complexity of the cycle index polynomial
- scientific article; zbMATH DE number 4137315 (Why is no real title available?)
- An algorithm for polynomial multiplication that does not depend on the ring constants
- scientific article; zbMATH DE number 4072975 (Why is no real title available?)
- Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
- Partition of symmetric powers of \(G\)-sets into orbits: application to the enumeration of force constants
- scientific article; zbMATH DE number 5026599 (Why is no real title available?)
- A recursion of the Pólya polynomial for the symmetric group
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
This page was built for publication: An algorithm for the multiplication of symmetric polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3821570)