Related papers: Algorithm for computing the factor ring of an idea…
Let $R$ be a normal Noetherian local domain of Krull dimension two. We examine intersections of rank one discrete valuation rings that birationally dominate $R$. We restrict to the class of prime divisors that dominate $R$ and show that if…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
Suppose that $R$ is a local domain essentially of finite type over a field of characteristic 0, and $\nu$ a valuation of the quotient field of $R$ which dominates $R$. The rank of such a valuation often increases upon extending the…
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
Given a square matrix $A$ with entries in a commutative ring $S$, the ideal of $S[X]$ consisting of polynomials $f$ with $f(A) =0$ is called the null ideal of $A$. Very little is known about null ideals of matrices over general commutative…
Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…
This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
Completely prime right ideals are introduced as a one-sided generalization of the concept of a prime ideal in a commutative ring. Some of their basic properties are investigated, pointing out both similarities and differences between these…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…
Recent breakthroughs have been made in the use of semidefinite programming and its application to real polynomial solving. For example, the real radical of a zero dimensional ideal, can be determined by such approaches as shown by Lasserre…
Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…
The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…
Given three lists of ideals of a Dedekind domain, the question is raised, whether there exist two matrices A and B with entries in the given Dedekind domain, such that the given lists of ideals are the determinantal divisors of A, B, and…
We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…
Given a ring $R$, the notion of Sylvester rank function was conceived within the context of Cohn's classification theory of epic division $R$-rings. In this paper we study and describe the space of Sylvester rank functions on certain…
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…