Related papers: Computing and Using Minimal Polynomials

In this paper, we consider interpolation by \textit{completely monotonous} polynomials (CMPs for short), that is, polynomials with non-negative real coefficients. In particular, given a finite set $S\subset \mathbb{R}_{>0} \times…

We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the arithmetic multiplicity. Minimal differential…

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…

In this paper we introduce the concept of inessential element of a standard basis of I, where I is any homogeneous ideal of a polynomial ring. An inessential element is, roughly speaking, a form of the basis whose omission produces an ideal…

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

A short proof of the "Rigidity theorem" using the sheaf theoretic model for Hilbert modules over polynomial rings is given. The joint kernel for a large class of submodules is described. The completion $[\mathcal I]$ of a homogeneous…

The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures of data in many…

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…

We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

We show that a determinantal ideal generated by $t$-minors does not contain any nonzero polynomials with $t!/2$ or fewer terms. Geometrically this means that any nonzero polynomial vanishing on all matrices of rank at most $t-1$ has more…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

We propose a novel numerical approach to compute the Pareto front in multivariate polynomial multi-objective optimization problems. When the objective functions and (equality) constraints are multivariate polynomials, the Pareto front,…