English
Related papers

Related papers: Appell polynomial sequences with respect to some d…

200 papers

By means of the Bessel operator a polynomial sequence is constructed to which several properties are given. Among them, its explicit expression, the connection with the Euler numbers, its integral representation via the Kontorovich-Lebedev…

Classical Analysis and ODEs · Mathematics 2011-04-21 Ana F. Loureiro , P. Maroni , S. Yakubovich

The lambda calculus since more than half a century is a model and foundation of functional programming languages. However, lambda expressions can be evaluated with different reduction strategies and thus, there is no fixed cost model nor…

Programming Languages · Computer Science 2024-05-22 Tomasz Drab

We give a Riemann-Hilbert approach to the theory of matrix orthogonal polynomials. We will focus on the algebraic aspects of the problem, obtaining difference and differential relations satisfied by the corresponding orthogonal polynomials.…

Classical Analysis and ODEs · Mathematics 2011-10-26 F. Alberto Grünbaum , Manuel D. de la Iglesia , Andrei Martinez-Finkelshtein

We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…

Numerical Analysis · Mathematics 2016-07-06 Leonardo Robol , Raf Vandebril , Paul Van Dooren

We introduce the $q$-analogue of the type $A$ Dunkl operators, which are a set of degree--lowering operators on the space of polynomials in $n$ variables. This allows the construction of raising/lowering operators with a simple action on…

q-alg · Mathematics 2008-02-03 T. H. Baker , P. J. Forrester

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

Number Theory · Mathematics 2021-03-01 Abdelmejid Bayad , Takao Komatsu

We introduce the concept of $\D$-operators associated to a sequence of polynomials $(p_n)_n$ and an algebra $\A$ of operators acting in the linear space of polynomials. In this paper, we show that this concept is a powerful tool to generate…

Classical Analysis and ODEs · Mathematics 2013-02-06 Antonio J. Durán

Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…

Classical Analysis and ODEs · Mathematics 2024-03-19 Lidia Aceto , Helmuth Robert Malonek , Graça Tomaz

In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…

Mathematical Physics · Physics 2019-01-01 Andrey V. Sokolov

At the first part of the paper we show how specific umbral extensions of the Stirling numbers of the second kind result in new type of Dobinski-like formulas. In the second part among others one recovers how and why Ward solution of…

Combinatorics · Mathematics 2016-09-07 A. K. Kwasniewski

In this paper, we investigate a specific class of $q$-polynomial sequences that serve as a $q$-analogue of the classical Appell sequences. This framework offers an elegant approach to revisiting classical results by Carlitz and, more…

Number Theory · Mathematics 2025-01-07 Bakir Farhi

The quantum Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under commutators. This polynomial closure is also typical for 2nd order superintegrable…

Mathematical Physics · Physics 2015-06-11 E. G. Kalnins , J. M. Kress , W. Miller

A generic differential operator on the vectorial space of polynomial functions was presented in a recent work and applied in the study of differential relations fulfilled by polynomial sequences either orthogonal or 2-orthogonal. Using the…

Classical Analysis and ODEs · Mathematics 2021-12-28 Teresa Augusta Mesquita

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number--theoretical properties. A new class of…

Number Theory · Mathematics 2021-12-16 Piergiulio Tempesta

We address a systematic combinatorial approach to the anti-normal ordering problem. In this way, we use the Stirling numbers and their generating function, the so-called Bell polynomials, together with the operational methods to anti-normal…

Mathematical Physics · Physics 2012-04-18 M. R. Bazrafkan , F. Shähandeh , E. Nahvifard

The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…

Dynamical Systems · Mathematics 2012-01-27 Mark Comerford

Let $P(z)$ be a polynomial of degree $n\geq 1$. In this paper we define an operator $B$, as following, $$B[P(z)]:=\lambda_0 P(z)+\lambda_1 (\frac{nz}{2}) \frac{P'(z)}{1!}+\lambda_2 (\frac{nz}{2})^2 \frac{P''(z)}{2!},$$ where…

Complex Variables · Mathematics 2009-03-06 M. Ahmadi Baseri , M. Bidkham , M. Eshaghi Gordji

In this paper, we prove super-polynomial lower bounds for the model of \emph{sum of ordered set-multilinear algebraic branching programs}, each with a possibly different ordering ($\sum \mathsf{smABP}$). Specifically, we give an explicit…

Computational Complexity · Computer Science 2024-02-20 Prerona Chatterjee , Deepanshu Kush , Shubhangi Saraf , Amir Shpilka

Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…

Representation Theory · Mathematics 2019-08-09 Yohny Calderón-Henao , Hernán Giraldo , José A. Vélez-Marulanda

A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…

Programming Languages · Computer Science 2007-05-23 Manfred Schmidt-Schauß , Michael Huber