相关论文: Computing the Hermite Form of a Matrix of Ore Poly…

Given an n x n matrix over the ring of differential polynomials F(t)[\D;\delta], we show how to compute the Hermite form H of A, and a unimodular matrix U such that UA=H. The algorithm requires a polynomial number of operations in terms of…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…

Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\OK$-module presented by Cohen, where $\OK$ is the ring of integers of a number field K. The modular strategy was conjectured to run in polynomial…

Following several decades of successive algorithmic improvements, works from the 2010s have showed how to compute the Hermite normal form (HNF) of a univariate polynomial matrix within a complexity bound which is essentially that of…

We present a variation of the modular algorithm for computing the Hermite normal form of an $\mathcal O_K$-module presented by Cohen, where $\mathcal O_K$ is the ring of integers of a number field $K$. An approach presented in (Cohen 1996)…

Let $\mathcal{R}:=\mathbb{F}[{\bf x};\sigma,\delta]$ be a multivariate skew polynomial ring over a division ring $\mathbb{F}$. In this paper, we introduce the notion of right and left $(\sigma,\delta)$-partial derivatives of polynomials in…

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

A Las Vegas randomized algorithm is given to compute the Hermite normal form of a nonsingular integer matrix $A$ of dimension $n$. The algorithm uses quadratic integer multiplication and cubic matrix multiplication and has running time…

We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…

In this article, the matrix elements of a representation of the 5-dimensional Lie algebra K5 are obtained for the first time. The bivariate degenerate Hermite polynomials Hm(z1, z2|{\tau} ) are considered within the context of this…

Let $\mathbb{F}$ be a division ring. In this paper, we extent some of the main well-known results about the resultant of two univariate polynomials to the more general context of an Ore extension $\mathbb{F}[x;\sigma,\delta]$. Finally, some…

We propose and study the properties of a set of polynomials $M_{n\alpha, H\ }^{s}(z)$, $C_{n\alpha, H}^{s}(z)$ $W_{n\alpha, H}^{s}(z)$ with $n,s\in N$ $;\alpha =\pm 1;$and where $H$ stands for Hermite ; the ''root '' polynomial >.These…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

In this paper, we first present an algorithm for computing the Hermite normal form of pseudo-matrices over Pr\"ufer domains. This algorithm allows us to provide constructive proofs of the main theoretical results on finitely presented…

Motivated by classical results of approximation theory, we define an Hermite-type interpolation in terms of $n$-dimensional subspaces of the space of $n$ times continuously differentiable functions. In the main result of this paper, we…