Riordan arrays and generalized Euler polynomials
Abstract: Generalization of the Euler polynomials ${{A}{n}}\left( x \right)={{\left( 1-x \right)}{n+1}}\sum\nolimits{m=0}{\infty }{{{m}{n}}{{x}{m}}}$ are the polynomials ${{\alpha }{n}}\left( x \right)={{\left( 1-x \right)}{n+1}}\sum\nolimits{m=0}{\infty }{{{u}{n}}}\left( m \right){{x}{m}}$, where ${{u}{n}}\left( x \right)$ is the polynomial of degree $n$. These polynomials appear in various fields of mathematics, which causes a variety of methods for their study. In present paper we will consider generalized Euler polynomials as an attribute of the theory of Riordan arrays. From this point of view, we will consider the transformations associated with them, with a participation of such objects as binomial sequences, Stirling numbers, multinomial coefficients, shift operator, and demonstrate a constructiveness of the chosen point of view.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.