Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Riordan arrays and generalized Euler polynomials (1709.02229v2)

Published 7 Sep 2017 in math.NT

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.

Summary

We haven't generated a summary for this paper yet.