A Digital Binomial Theorem

2014/12/10 by Hiêú D. Nguyêñ, Hieu D. Nguyen, Nguyen, Hieu D. · 3 citations
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Digital Image Processing Techniques #Numerical Methods and Algorithms #math.NT #msc:11

paper · pdf · doi:10.48550/arxiv.1412.3181

5 pages

arxiv created 2014/12/10 · arxiv updated 2014/12/11

Abstract

We present a triangle of connections between the Sierpinski triangle, the sum-of-digits function, and the Binomial Theorem via a one-parameter family of Sierpinski matrices, which encodes a digital version of the Binomial Theorem.

Cited by

• A Generalization of the Digital Binomial Theorem
• Base-b analogues of classic combinatorial objects
• Generalized Riordan arrays and zero generalized Pascal matrices

Related

• A Generalization of the Digital Binomial Theorem
• A Digital Binomial Theorem for Sheffer Sequences
• A q-Digital Binomial Theorem
• On the Sierpinski triangle and its generalizations
• Base-b analogues of classic combinatorial objects