arXiv · 1501.05998
A Generalization of the Digital Binomial Theorem
Abstract
We prove a generalization of the digital binomial theorem by constructing a one-parameter subgroup of generalized Sierpinski matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe group relations satisfied by generating matrices defined in terms of these Sierpinski matrices.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hieu D. Nguyen. 2015-01-24. A Generalization of the Digital Binomial Theorem. https://arxiv.org/abs/1501.05998
Cite the original work for its findings. Save a collection to share your selection of sources.