Related papers: Normalization of Quaternionic Polynomials in Coord…
A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…
The GVW algorithm is a signature-based algorithm for computing Gr\"obner bases. If the input system is not homogeneous, some J-pairs with higher signatures but lower degrees are rejected by GVW's Syzygy Criterion, instead, GVW have to…
We investigate the algebra generated by the operators $x$ and $\mathrm{I} = \int_0^x$, which satisfy the commutation relation \[ [\mathrm{I},x] = \mathrm{I}x - x\mathrm{I} = - \mathrm{I}^2. \] We develop a combinatorial framework for the…
We introduce the quaternionic Mahler measure for non-commutative polynomials, extending the classical complex Mahler measure. We establish the existence of quaternionic Mahler measure for slice regular polynomials in one and two variables.…
Quaternionic analysis relies heavily on results on functions defined on domains in $\mathbb R^4$ (or $\mathbb R^3$) with values in $\mathbb H$. This theory is centered around the concept of $\psi-$hyperholomorphic functions i.e.,…
To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
The analogous quaternionic polynomials of a class of bivariate orthogonal polynomials (arXiv: 1502.07256, 2014) introduced. The ladder operators for these quaternionic polynomials also studied. For the quaternionic case, the ladder…
This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
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…
Minimal problems in computer vision raise the demand of generating efficient automatic solvers for polynomial equation systems. Given a polynomial system repeated with different coefficient instances, the traditional Gr\"obner basis or…
We present an elegant, generic and extensive formalization of Gr\"obner bases in Isabelle/HOL. The formalization covers all of the essentials of the theory (polynomial reduction, S-polynomials, Buchberger's algorithm, Buchberger's criteria…
In this paper an explicit form of generalized Chebyshev Koornwinder's type polynomial of first kind in terms of the Bernstein basis of fixed degree $n$ is provided. Moreover, we investigate generalized Chebyshev Koornwinder's type…