A de Bruijn-type formula for enumerating patterns of partitions

DOI10.1007/BF01836419zbMath0381.05002OpenAlexW2083659472MaRDI QIDQ1247325

Dennis E. White

Publication date: 1977

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136675

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Multiply transitive finite groups (20B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Classifying patterns by automorphism group: An operator theoretic approach
• Computational Algorithms for the Enumeration of Group Invariant Partitions
• Combinatorial Structures and Group Invariant Partitions

This page was built for publication: A de Bruijn-type formula for enumerating patterns of partitions