Classifying patterns by automorphism group: An operator theoretic approach
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3231901 (Why is no real title available?)
- scientific article; zbMATH DE number 3378920 (Why is no real title available?)
- scientific article; zbMATH DE number 3198028 (Why is no real title available?)
- scientific article; zbMATH DE number 3109449 (Why is no real title available?)
- Counting Patterns with a Given Automorphism Group
- Isomorph Rejection and a Theorem of De Bruijn
- Linear and Multilinear Aspects of Isomorph Rejection
- On Pólya's Theorem
- On Redfield's Group Reduction Functions
- Pólya's Counting Theorem and a Class of Tensor Identities
- The Number of Graphs with a given Automorphism Group
- The combinatorial analysis of patterns and the principle of inclusion- exclusion
Cited in
(7)- Adams operations and \(\lambda\)-operations in \(\beta\)-rings
- A de Bruijn-type formula for enumerating patterns of partitions
- A generalization of Burnside's combinatorial lemma
- A Polya interpretation of the Schur function
- Applications of a binoomial-type identity
- Combinatorial Structures and Group Invariant Partitions
- Multilinear techniques in pólya enumeration theory
This page was built for publication: Classifying patterns by automorphism group: An operator theoretic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1222164)