Related papers: Normalization of Quaternionic Polynomials
We consider a quaternionic analogue of the univariate complex Hermite polynomials and study some of their analytic properties in some detail. We obtain their integral representation as well as the operational formulas of exponential and…
In this paper we show that a split central simple algebra with quadratic pair which decomposes into a tensor product of quaternion algebras with involution and a quaternion algebra with quadratic pair is adjoint to a quadratic Pfister form.…
Using notions of composita and composition of generating functions we obtain explicit formulas for Chebyshev polynomials, Legendre polynomials, Gegenbauer polynomials, Associated Laguerre polynomials, Stirling polynomials, Abel polynomials,…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
Tensor models are measures for random tensors. They generalise matrix models and were developed to study random geometry in arbitrary dimension. Moreover, they are strongly connected to quantum gravity theories as additionally to the…
Based on the framework of Plamen Iliev, multivariate Meixner polynomials are constructed explicitly as Birth and Death polynomials. They form the complete set of eigenpolynomials of a birth and death process with the birth and death rates…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
There are some distinguished ensembles of non-Hermitian random matrices for which the joint PDF can be written down explicitly, is unchanged by rotations, and furthermore which have the property that the eigenvalues form a Pfaffian point…
It is known that polynomials over quaternions may have spherical zeros and isolated left and right zeros. These zeros along with appropriately defined multiplicities form the zero structure of a polynomial. In this paper, we equivalently…
Given a square matrix $B$ over a principal ideal domain $D$ and an ideal $J$ of $D$, the $J$-ideal of $B$ consists of the polynomials $f\in D[X]$ such that all entries of $f(B)$ are in $J$. It has been shown that in order to determine all…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
The theory of quaternionic modular forms has been studied for decades as an example of the modular forms of many variables. The purpose of this study is to provide some congruence relations satisfied by such quaternionic modular forms.
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…
The theory of zonal polynomials is used to compute the average of a Schur polynomial of argument $AX$, where $A$ is a fixed matrix and $X$ is from the real Ginibre ensemble. This generalizes a recent result of Sommers and Khorozhenko [J.…
Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…
Techniques from representation theory, symbolic computational algebra, and numerical algebraic geometry are used to find the minimal generators of the ideal of the trifocal variety. An effective test for determining whether a given tensor…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
The aim of this paper is to give a new approach to modified $q$-Bernstein polynomials for functions of several variables. By using these polynomials, the recurrence formulas and some new interesting identities related to the second Stirling…
Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…