Combinatorial proofs of some Bell number formulas

MaRDI QIDQ2809933zbMATHFDO

Authors Mark Shattuck

Publication date 30 May 2016

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.6588

zbMATH Keywords

complete Bell polynomialsbijective proofs of identities

Mathematics Subject Classification ID

Partitions of sets (05A18) Bell and Stirling numbers (11B73)

Abstract: In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further interpretation for a related difference of Catalan numbers in terms of the inclusion-exclusion principle.

Recommendations

• Combinatorial proofs of some Stirling number formulas
• Some formulas for Bell numbers
• A generalized recurrence for Bell numbers
• scientific article; zbMATH DE number 7152067
• scientific article; zbMATH DE number 4055619

Cited in

(10)

• scientific article; zbMATH DE number 6272304 (Why is no real title available?)
• Combinatorial proofs of some Stirling number formulas
• Some formulas for Bell numbers
• Generalizations of Bell number formulas of spivey and Mező
• scientific article; zbMATH DE number 7471007 (Why is no real title available?)
• Bijective proofs of formulas with \((-1)^n\)
• scientific article; zbMATH DE number 4055619 (Why is no real title available?)
• Combinatorial properties of the factorial ring
• Combinants, Bell polynomials and applications
• Complementary Bell Numbers: Arithmetical Properties and Wilf’s Conjecture

This page was built for publication: Combinatorial proofs of some Bell number formulas

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