Papers
Topics
Authors
Recent
Search
2000 character limit reached

Riordan arrays and generalized Euler polynomials

Published 7 Sep 2017 in math.NT | (1709.02229v2)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.