A Generalization of the Digital Binomial Theorem
Number Theory
2015-01-27 v1
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.
Keywords
Cite
@article{arxiv.1501.05998,
title = {A Generalization of the Digital Binomial Theorem},
author = {Hieu D. Nguyen},
journal= {arXiv preprint arXiv:1501.05998},
year = {2015}
}
Comments
14 pages