Pólya's Counting Theorem and a Class of Tensor Identities

DOI10.1112/jlms/s2-3.3.411zbMath0236.05001OpenAlexW2061548136MaRDI QIDQ5645420

S. Gill Williamson

Publication date: 1971

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-3.3.411

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (9)

Permutational isomers on a molecular skeleton with neighbor-excluding ligands ⋮ Probabilistic analogs of Pólya's enumeration theory ⋮ Cycle indices and subgroup lattices ⋮ Generalized matrix functions and pattern inventory^† ⋮ Tensor compositions and lists of combinatorial structures ⋮ Classifying patterns by automorphism group: An operator theoretic approach ⋮ Multilinear techniques in pólya enumeration theory ⋮ The combinatorial analysis of patterns and the principle of inclusion- exclusion ⋮ Tensors and Graphs

This page was built for publication: Pólya's Counting Theorem and a Class of Tensor Identities