A theorem on Molien type in combinatorics

DOI10.1016/S0195-6698(89)80049-6zbMath0683.05002OpenAlexW2039723627MaRDI QIDQ1824619

Torbjörn Tambour

Publication date: 1989

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(89)80049-6

zbMATH Keywords

Pólya enumerationBurnside's lemma

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites Work

• Some formulas in invariant theory
• Invariant theory
• Unnamed Item
• Unnamed Item

This page was built for publication: A theorem on Molien type in combinatorics