Polya's Counting Theorem Via Tensors

DOI10.2307/2320463zbMath0467.05037OpenAlexW4231417664MaRDI QIDQ3919741

Russell Merris

Publication date: 1981

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2320463

zbMATH Keywords

cycle indextensorsBurnside's lemmaPolya's counting theorem

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Enumeration in graph theory (05C30)

Related Items (2)

Enumeration of substitutional isomers with restrictive mutual positions of ligands. II. Counts with restrictions on (sub)symmetry ⋮ Tensors and Graphs

This page was built for publication: Polya's Counting Theorem Via Tensors