Related papers: Rational Convolution Roots of Isobaric Polynomials
In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
Linearization is a standard approach in the computation of eigenvalues, eigenvectors and invariant subspaces of matrix polynomials and rational matrix value functions. An important source of linearizations are the so called Fiedler…
In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational…
In this paper, we deal with the convolution series that are a far reaching generalization of the conventional power series and the power series with the fractional exponents including the Mittag-Leffler type functions. Special attention is…
The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian…
Let $\left( g\left( x \right),xg\left( x \right) \right)$ be a Riordan matrix from the Bell subgroup. We denote ${{\left( g\left( x \right),xg\left( x \right) \right)}^{\varphi }}=\left( {{g}^{\left( \varphi \right)}}\left( x…
Starting from certain rational varieties blown-up from (P^1)^N, we construct a tropical, i.e., subtraction-free birational, representation of Weyl groups as a group of pseudo isomorphisms of the varieties. Furthermore, we develop an…
In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate…
The concept of a $1$-rotational factorization of a complete graph under a finite group $G$ was studied in detail by Buratti and Rinaldi. They found that if $G$ admits a $1$-rotational $2$-factorization, then the involutions of $G$ are…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
The aim of this paper is to study the fully degenerate Bernoulli polynomials and numbers, which are a degenerate version of Bernoulli polynomials and numbers and arise naturally from the Volkenborn integral of the degenerate exponential…
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…
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
Recent results for rotations expressed as polynomials of spin matrices are derived here by elementary differential equation methods. Structural features of the results are then examined in the framework of biorthogonal systems, to obtain an…
We construct new integral representations for transformations of the ordinary generating function for a sequence, $\langle f_n \rangle$, into the form of a generating function that enumerates the corresponding "square series" generating…
In this work, we construct commutative rings of two variable matrix differential operators that are isomorphic to a ring of meromorphic functions on a rational manifold obtained from the $CP^1\times CP^1$ by identification of two lines with…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
We consider generalized Stirling numbers of the second kind $% S_{a,b,r}^{\alpha_{s},\beta_{s},r_{s},p_{s}}\left( p,k\right) $, $% k=0,1,\ldots .rp+\sum_{s=2}^{L}r_{s}p_{s}$, where $a,b,\alpha_{s},\beta_{s} $ are complex numbers, and…