We recover a recurrence relation for representing in an easy form the coefficients $ A_{n,k} $ of the Bell polynomials, which are known in literature as the partial Bell polynomials. Several applications in the framework of classical calculus are derived, avoiding the use of operational techniques. Furthermore, we generalize this result to the coefficients $ A^{[2]}_{n,k} $ of the second-order Bell polynomials, i.e. of the Bell polynomials relevant to nth derivative of a composite function of the type f(g(h(t))). The second-order Bell polynomials $ B_n^{[2]} $ and the relevant Bell numbers $ b_n^{[2]} $ are introduced. Further extension of the nth derivative of M-nested functions is also touched on
AbstractIn this paper, the higher-order tangent numbers and higher-order secant numbers, {T(n,k)}n,k...
A recursive relation for Bell polynomials of arbitrary order is given. Such a result is useful, in t...
AbstractThis paper concerns the study of the Bell polynomials and the binomial type sequences. We ma...
We recover a recurrence relation for representing in an easy form the coefficients $ A_{n,k} $ of th...
AbstractWe develop some extensions of the classical Bell polynomials, previously obtained, by introd...
AbstractWe develop some extensions of the classical Bell polynomials, previously obtained, by introd...
We develop some extensions of the classical Bell polynomials, previously obtained, by introducing a ...
We develop some extensions of the classical Bell polynomials, previously obtained, by introducing a ...
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
AbstractThe well-known Faà di Bruno formula for higher derivatives of a composite function plays an ...
In 1859, Cayley introduced the ordered Bell numbers which have been used in many problems in number ...
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
AbstractIn this paper, the higher-order tangent numbers and higher-order secant numbers, {T(n,k)}n,k...
A recursive relation for Bell polynomials of arbitrary order is given. Such a result is useful, in t...
AbstractThis paper concerns the study of the Bell polynomials and the binomial type sequences. We ma...
We recover a recurrence relation for representing in an easy form the coefficients $ A_{n,k} $ of th...
AbstractWe develop some extensions of the classical Bell polynomials, previously obtained, by introd...
AbstractWe develop some extensions of the classical Bell polynomials, previously obtained, by introd...
We develop some extensions of the classical Bell polynomials, previously obtained, by introducing a ...
We develop some extensions of the classical Bell polynomials, previously obtained, by introducing a ...
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
AbstractThe well-known Faà di Bruno formula for higher derivatives of a composite function plays an ...
In 1859, Cayley introduced the ordered Bell numbers which have been used in many problems in number ...
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
Using Bell’s polynomials it is possible to approximate the Laplace Transform of composite functions....
AbstractIn this paper, the higher-order tangent numbers and higher-order secant numbers, {T(n,k)}n,k...
A recursive relation for Bell polynomials of arbitrary order is given. Such a result is useful, in t...
AbstractThis paper concerns the study of the Bell polynomials and the binomial type sequences. We ma...