A Generalization of the Digital Binomial Theorem
classification
🧮 math.NT
keywords
matricesbinomialdigitalgeneralizationsierpinskitheoremadditioncoefficients
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.