A generalization of the digital binomial theorem

MaRDI QIDQ5502204zbMATH OpenFDO

Authors Hieu D. Nguyen

Publication date 18 August 2015

Full work available at URL https://arxiv.org/abs/1501.05998, http://www.emis.de/journals/JIS/VOL18/Nguyen/nguyen6.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

binomial theoremProuhet-Thue-Morse sequenceSierpiński triangle

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Matrices, determinants in number theory (11C20) Matrices of integers (15B36)

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.

Recommendations

• scientific article; zbMATH DE number 7157988
• A matrix approach to the binomial theorem
• A matrix generalization of a theorem of Fine
• A new generalization of binomial coefficients
• Generalized binomial expansions and Bernoulli polynomials

Cited in

(6)

• A generalization of a theorem by Cheo and Yien concerning digital sums
• Digit sums and generating functions
• Fractal generalized Pascal matrices
• A class of digit extraction BBP-type formulas in general binary bases
• Exact exponent in the remainder term of Gelfond's digit theorem in the binary case
• scientific article; zbMATH DE number 7157988 (Why is no real title available?)

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A generalization of the digital binomial theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502204)