Classifying patterns by automorphism group: An operator theoretic approach

DOI10.1016/0012-365X(75)90024-2zbMath0318.05005MaRDI QIDQ1222164

Dennis E. White

Publication date: 1975

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(75)90024-2

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

05C30: Enumeration in graph theory

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

47B99: Special classes of linear operators

Related Items

Adams operations and \(\lambda\)-operations in \(\beta\)-rings, A Polya interpretation of the Schur function, A de Bruijn-type formula for enumerating patterns of partitions, A generalization of Burnside's combinatorial lemma, Multilinear techniques in pólya enumeration theory, Applications of a binoomial-type identity, Combinatorial Structures and Group Invariant Partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorial analysis of patterns and the principle of inclusion- exclusion
• Linear and Multilinear Aspects of Isomorph Rejection
• Counting Patterns with a Given Automorphism Group
• On Pólya's Theorem
• The Number of Graphs with a given Automorphism Group
• Pólya's Counting Theorem and a Class of Tensor Identities
• Isomorph Rejection and a Theorem of De Bruijn
• On Redfield's Group Reduction Functions