A generalization of Burnside's combinatorial lemma
From MaRDI portal
Publication:1247969
DOI10.1016/0097-3165(76)90021-2zbMath0382.05005OpenAlexW1969289772WikidataQ124972837 ScholiaQ124972837MaRDI QIDQ1247969
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
Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Geometric group theory (20F65)
Related Items
Orbits of Boolean functions ⋮ Cycle indices and subgroup lattices ⋮ Some remarks on the computation of conjugacy classes of soluble groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying patterns by automorphism group: An operator theoretic approach
- An Interpretation of the Finite Mean LIL Norming Constants
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- THE EULERIAN FUNCTIONS OF A GROUP
- On The Number of Symmetry Types of Boolean Functions of n Variables
- The Number of Linear, Directed, Rooted, and Connected Graphs
