A generalization of Burnside's combinatorial lemma

DOI10.1016/0097-3165(76)90021-2MaRDI QIDQ1247969zbMATH OpenOpenAlexWikidataFDO

Authors Michael J. Klass

Publication date 1976

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(76)90021-2

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Geometric group theory (20F65)

Cites work

• scientific article; zbMATH DE number 3138899 (Why is no real title available?)
• scientific article; zbMATH DE number 3487582 (Why is no real title available?)
• scientific article; zbMATH DE number 3227009 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• scientific article; zbMATH DE number 3190209 (Why is no real title available?)
• An Interpretation of the Finite Mean LIL Norming Constants
• Classifying patterns by automorphism group: An operator theoretic approach
• On The Number of Symmetry Types of Boolean Functions of n Variables
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• THE EULERIAN FUNCTIONS OF A GROUP
• The Number of Linear, Directed, Rooted, and Connected Graphs

Cited in

(3)

• Cycle indices and subgroup lattices
• Orbits of Boolean functions
• Some remarks on the computation of conjugacy classes of soluble groups

This page was built for publication: A generalization of Burnside's combinatorial lemma

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