Related papers: Bessel polynomials, double factorials and context-…
We determine all F,G in C[X] of degree at least 2 for which the semigroup generated by F and G under composition is not the free semigroup on the letters F and G. We also solve the same problem for F,G in X^2 C[[X]], and prove partial…
An iterative construction of higher order Einstein tensors for a maximally Gauss-Bonnet extended gravitational Lagrangian was introduced in a previous paper. Here the formalism is extended to non-factorisable metrics in arbitrary ($d+1$)…
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
Recently, Haglund and Visontai established the stability of the multivariate Eulerian polynomials as the generating polynomials of the Stirling permutations, which serves as a unification of some results of B\'{o}na, Brenti, Janson, Kuba,…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our…
We give a bracket polynomial expression for intermediate terms between discriminant and resultant for pair of binary forms. As an application of the bracket polynomial expression, we give an algebraic proof of the algebraic independence of…
We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…
We study the Fourier transform of polynomials in an orthogonal family, taken with respect to the orthogonality measure. Mastering the asymptotic properties of these transforms, that we call Fourier--Bessel functions, in the argument, the…
Probabilistic context-free grammars (PCFGs), which are commonly used to generate trees randomly, have been well analyzed theoretically, leading to applications in various domains. Despite their utility, the distributions that the grammar…
For a real polynomial $f$ we present explicit zero-free angular sectors in the complex plane, symmetric with respect to the real axis, with angles depending only on the degree of $f$, and vertices expressed in terms of the coefficients of…
In this paper, we study a class of sequences of polynomials linked to the sequence of Bell polynomials. Some sequences of this class have applications on the theory of hyperbolic differential equations and other sequences generalize…
In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…
The goal of this paper is to extend the classical and multiplicative fractional derivatives. For this purpose, it is introduced the new extended modified Bessel function and also given an important relation between this new function…
It is natural for probabilistic programs to use conditionals to express alternative substructures in models, and loops (recursion) to express repeated substructures in models. Thus, probabilistic programs with conditionals and recursion…
In a recent paper, Yu. A. Brychkov derived a series of identities for multiples sums of special functions, using generating functions. Among these identities, a particularly interesting one involves multiples sums of Bessel $I_{\nu}$…
In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in…