Abstract
We prove a generalization of the digital binomial theorem by constructing a one- parameter subgroup of generalized Sierpiński 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 Sierpiński matrices.
| Original language | English (US) |
|---|---|
| Journal | Journal of Integer Sequences |
| Volume | 18 |
| Issue number | 5 |
| State | Published - 2015 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'A generalization of the digital binomial theorem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver