Matrix representation for combinatorics

DOI10.1016/0097-3165(84)90037-2zbMATH Open0548.05004OpenAlexW2005208814MaRDI QIDQ799673FDOQ799673

John G. Kemeny

Publication date: 1984

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(84)90037-2

zbMATH Keywords

derivativedenumerably infinite matricesrepresentation of combinatorial quantities

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Recursive matrices and umbral calculus
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• A uniform realization of the combinatorial \(R\)-matrix
• The combinatorial compound of permutation matrix and graphical representation
• Riordan arrays and combinatorial sums
• Integral Representation and Algorithms for Closed Form Summation
• Title not available (Why is that?)
• Title not available (Why is that?)

Recommendations

• Combinatorial matrix theory 👍 👎
• A combinatorial approach to matrix algebra 👍 👎
• Combinatorial Matrix Theory 👍 👎
• Combinatorial matrix theory 👍 👎
• Matrices with Integer Elements in Combinatorial Investigations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Matrix representation for combinatorics

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