相关论文: Umbral presentations for polynomial sequences
Trough the classical umbral calculus, we provide new, compact and easy to handle expressions of k-statistics, and more in general of U-statistics. In addition such a symbolic method can be naturally extended to multivariate case and to…
Using the methods of classical invariant theory a general approach to finding of identities for Bernulli, Euler and Hermite polynomials is proposed.
Jeffery's 1861 computations using finite difference calculus are resurrected and extended from forward differences to general delta operators and used to neatly prove theorems in the Rota--Mullins theory of polynomials of binomial type…
Combinatorial formulas expressing cyclic rook polynomials and cyclic permanents of rectangular matrices in terms of expansions along rows are presented
By using a symbolic technique known in the literature as the classical umbral calculus, we characterize two classes of polynomials related to L\'evy processes: the Kailath-Segall and the time-space harmonic polynomials. We provide the…
In this paper, we consider the problem of representing any polynomial in terms of the ordered Bell and degenerate ordered Bell polynomials, and more generally of the higher-order ordered Bell and higher-order degenerate ordered Bell…
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
We present an algebraic theory of orthogonal polynomials in several variables that includes classical orthogonal polynomials as a special case. Our bottom line is a straightforward connection between apolarity of binary forms and the inner…
Dual numbers and their higher order version are important tools for numerical computations, and in particular for finite difference calculus. Based upon the relevant algebraic rules and matrix realizations of dual numbers, we will present a…
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
Differintegral methods, currently exploited in calculus, provide a fairly unexhausted source of tools to be applied to a wide class of problems involving the theory of special functions and not only. The use of integral transforms of Borel…
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…
We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits…
Recently, Kim-Kim introduced the lambda-umbral calculus, in which the lambda-Sheffer sequences occupy the central position. In this paper, we introduce the fully degenerate Bell and the fully degenerate Dowling polynomials, and investigate…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
In a recent paper, Yi-Ping Yu has given some interesting nonlinear moments of the Bernoulli umbra; the aim of this paper is to show the probabilistic counterpart of these results and to extend them to Bernoulli polynomials.
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
This paper introduces a symbolic calculus-based approach for deriving closed-form expressions for the sums of arithmetic sequences. The method extends beyond constant-difference sequences to those with polynomially increasing steps,…