A Digital Binomial Theorem for Sheffer Sequences
classification
🧮 math.NT
keywords
sequencesshefferbinomialdigitaltheoremconvolutioncorrespondingdemonstrating
read the original abstract
We extend the digital binomial theorem to Sheffer polynomial sequences by demonstrating that their corresponding Sierpi\'nski matrices satisfy a multiplication property that is equivalent to the convolution identity for Sheffer sequences.
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.