Related papers: A Digital Binomial Theorem for Sheffer Sequences
We present a triangle of connections between the Sierpinski triangle, the sum-of-digits function, and the Binomial Theorem via a one-parameter family of Sierpinski matrices, which encodes a digital version of the Binomial Theorem.
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…
In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…
Motivated by the effective impact of the Pascal functional and the Wronskian matrices, we investigate several identities and differential equation for the Sheffer-Appell polynomial sequence by using matrix algebra. The matrix approach,…
The present work deals with the mathematical investigation of some generalizations of the Sz\'{a}sz operators. In this work, the multiple Sheffer polynomials are introduced. The generalization of Sz\'{a}sz operators involving multiple…
In this paper, we study some properties of Sheffer sequences for the powers of Sheffer pairs under umbral composition. From our properties we derive new and interesting identities of Sheffer sequences of special polynomials for the powers…
In this paper, we investigate some properties of several Sheffer sequences of several polynomials arising from umbral calculus. From our investigation, we can derive many interesting identities of several polynomials
In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…
Sheffer polynomials can be characterized using different Stieltjes integrals. These families of polynomials have been recently extended to the Dunkl context. In this way some classical operators as the derivative operator or the difference…
We characterize the Sheffer sequences by a single convolution identity $$ F^{(y)} p_{n}(x) = \sum _{k=0}^{n}\ p_{k}(x)\ p_{n-k}(y)$$ where $F^{(y)}$ is a shift-invariant operator. We then study a generalization of the notion of Sheffer…
The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…
The aim of this paper is to present a new simple recurrence for Appell and Sheffer sequences in terms of the linear functional that defines them, and to explain how this is equivalent to several well-known characterizations appearing in the…
The aim of this paper is to develop foundations of umbral calculus on the space $\mathcal D'$ of distributions on $\mathbb R^d$, which leads to a general theory of Sheffer polynomial sequences on $\mathcal D'$. We define a sequence of monic…
We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
Inspired by the framework of operational methods and based on the generating functions of Legendre-Gould Hopper polynomials and Sheffer sequences, we discuss certain new mixed type polynomials and their important properties. We show that…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
We show that a binomial identity arising in the context of the study of series expansions of $1/\pi$ can be seen as an incarnation of Whipples second theorem for hypergeometric series.
In this paper, we prove analogues of the Dirichlet theorem on arithmetic progressions and the Siegel--Walfisz theorem for the digital reverses of primes for arbitrary bases, which the authors obtained in the previous paper but only for…
We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…