Counting Patterns with a Given Automorphism Group

DOI10.2307/2040204MaRDI QIDQ4056174zbMATH OpenOpenAlexFDO

Authors Dennis White

Publication date 1975

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cites work

• scientific article; zbMATH DE number 3109449 (Why is no real title available?)
• Isomorph Rejection and a Theorem of De Bruijn
• On Redfield's Range-Correspondences
• The Number of Graphs with a given Automorphism Group

Cited in

(7)

• A Polya interpretation of the Schur function
• On asymmetric structures
• Counting asymmetric enriched trees
• Classifying patterns by automorphism group: An operator theoretic approach
• On a generalization of index series of species
• Cycle indices and subgroup lattices
• On the symmetry and asymmetry of combinatorial structures

This page was built for publication: Counting Patterns with a Given Automorphism Group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4056174)