Multilinear techniques in pólya enumeration theory

DOI10.1080/03081087908817289zbMath0427.05006OpenAlexW2052057350MaRDI QIDQ3863894

Dennis E. White

Publication date: 1979

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087908817289

zbMATH Keywords

enumerationpermutation groupmultilinearPolya patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Multilinear algebra, tensor calculus (15A69) General theory for finite permutation groups (20B05)

Related Items

Permutational isomers on a molecular skeleton with neighbor-excluding ligands, Generalized matrix functions and pattern inventory^†, Tensors and Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Classifying patterns by automorphism group: An operator theoretic approach
• Construction of vector lists and isomorph rejection
• The combinatorial analysis of patterns and the principle of inclusion- exclusion
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Linear and Multilinear Aspects of Isomorph Rejection
• Multilinear enumerative techniques
• Redfield's Theorems and Multilinear Algebra
• Probabilistic analogs of Pólya's enumeration theory
• Tensor compositions and lists of combinatorial structures
• Pólya's Counting Theorem and a Class of Tensor Identities
• Isomorph Rejection and a Theorem of De Bruijn
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]