Riordan arrays and generalized Euler polynomials

Abstract

Generalization of the Euler polynomials An( x )=( 1-x )n+1Σm=0∞ mnxm are the polynomials α n( x )=( 1-x )n+1Σm=0∞ un( m )xm, where un( x ) 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…