The combinatorial analysis of patterns and the principle of inclusion- exclusion

DOI10.1016/0012-365X(72)90043-XzbMath0243.05007OpenAlexW2155247294MaRDI QIDQ2554328

S. Gill Williamson

Publication date: 1972

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(72)90043-x

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Multilinear algebra, tensor calculus (15A69)

Related Items

A stochastic Gompertz model with hereditary effect ⋮ Linear and Multilinear Aspects of Isomorph Rejection ⋮ Generalized colored circular palindromic compositions ⋮ Multilinear enumerative techniques ⋮ Tensor compositions and lists of combinatorial structures ⋮ Classifying patterns by automorphism group: An operator theoretic approach ⋮ Construction of vector lists and isomorph rejection ⋮ Multilinear techniques in pólya enumeration theory ⋮ The dynamics of density dependent population models

Cites Work

• Contributions to the Cell Growth Problem
• On the number of certain lattice polygons
• Backtrack Programming
• On Pólya's Theorem
• The Use of S-Functions in Combinatorial Analysis
• Foundations of pattern analysis
• Inequalities for Matrix Functions of Combinatorial Interest
• Pólya's Counting Theorem and a Class of Tensor Identities
• On Redfield's Group Reduction Functions
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item