Related papers: Certain hybrid polynomials associated with Sheffer…
In this paper, we consider Hermite and poly-Bernoulli mixed-type polynomials and investigate the properties of those polynomials which are derived from umbral calculus. Finally, we give various identities associated with Stirling numbers,…
We take advantage of the combinatorial interpretations of many sequences of polynomials of binomial type to define a sequence of symmetric functions corresponding to each sequence of polynomials of binomial type. We derive many of the…
Some $q-$analogues of the normal ordering of the operator $(X+sD)^n$ on the polynomials are derived.
We obtain a series transformation formula involving the classical Hermite polynomials. We then provide a number of applications using appropriate binomial transformations. Several of the new series involve Hermite polynomials and harmonic…
A generalization of the generating function for Gegenbauer polynomials is introduced whose coefficients are given in terms of associated Legendre functions of the second kind. We discuss how our expansion represents a generalization of…
We construct explicit representations of the Heisenberg-Weyl algebra [P,M]=1 in terms of ladder operators acting in the space of Sheffer-type polynomials. Thus we establish a link between the monomiality principle and the umbral calculus.…
Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
The subject of this paper are polynomials in multiple non-commuting variables. For polynomials of this type orthogonal with respect to a state, we prove a Favard-type recursion relation. On the other hand, free Sheffer polynomials are a…
The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…
Schneps [J. Lie Theory 16 (2006), 19--37] has found surprising links between Ihara brackets and even period polynomials. These results can be recovered and generalized by considering some identities relating Ihara brackets and classical Lie…
Using known entropic and information inequalities new inequalities for some classical polynomials are obtained. Examples of Jacobi and Legendre polynomials are considered.
We consider multiple orthogonal polynomials corresponding to two Macdonald functions (modified Bessel functions of the second kind), with emphasis on the polynomials on the diagonal of the Hermite-Pad\'e table. We give some properties of…
We provide an explicit formula for the coefficient polynomials of a Hermite diagonal differential operator. The analysis of the zeros of these coefficient polynomials yields the characterization of generalized Hermite multiplier sequences…
We prove a generalization of classical Montel's theorem for the mixed differences case, for polynomials and exponential polynomial functions, in commutative setting.
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
Extending results of Wyser, we determine formulas for the equivariant cohomology classes of closed orbits of certain families of spherical subgroups of $GL_n$ on the flag variety $GL_n/B$. Putting this together with a slight extension of…
In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…
Generalizations of Bell polynomials, Bell numbers, and Stirling numbers of the second kind have been introduced and their generating functions were evaluated.
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…