AbstractThe purpose of this paper is to give a complete effective solution to the problem of computing radicals of polynomial ideals over general fields of arbitrary characteristic. We prove that Seidenberg’s “Condition P" is both a necessary and sufficient property of the coefficient field in order to be able to perform this computation. Since Condition P is an expensive additional requirement on the ground field, we use derivations and ideal quotients to recover as much of the radical as possible. If we have a basis for the vector space of derivations on our ground field, then the problem of computing radicals can be reduced to computing p th roots of elements in finite dimensional algebras
This paper deals with systems of polynomial differential equations, ordinary or with partial derivat...
O objetivo deste trabalho e computar, em alguns casos espec cos, os geradores do radical de um ideal...
Given a zero-dimensional ideal I in a polynomial ring, many algorithms start by finding univariate p...
AbstractThe purpose of this paper is to give a complete effective solution to the problem of computi...
The purpose of this paper is to give a complete effective solution to the problem of computing radic...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...
AbstractIn the present paper we describe an algorithm for the computation of real radicals of polyno...
AbstractWe propose an algorithm for computing the radical of a polynomial ideal in positive characte...
This paper shows an algorithm to construct the Gröbner bases of radicals of zero-dimensional ideals....
AbstractWe present a method that reduces the problem of computing the radical of a matrix algebra ov...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a...
AbstractIn this paper we are concerned with the computation of prime decompositions of radicals in p...
AbstractLet F be a finite subset of the differential polynomial algebra k { y 1,⋯ , yn } . In order ...
AbstractIn this paper we investigate how algorithms for computing heights, radicals, unmixed and pri...
This paper deals with systems of polynomial differential equations, ordinary or with partial derivat...
O objetivo deste trabalho e computar, em alguns casos espec cos, os geradores do radical de um ideal...
Given a zero-dimensional ideal I in a polynomial ring, many algorithms start by finding univariate p...
AbstractThe purpose of this paper is to give a complete effective solution to the problem of computi...
The purpose of this paper is to give a complete effective solution to the problem of computing radic...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...
AbstractIn the present paper we describe an algorithm for the computation of real radicals of polyno...
AbstractWe propose an algorithm for computing the radical of a polynomial ideal in positive characte...
This paper shows an algorithm to construct the Gröbner bases of radicals of zero-dimensional ideals....
AbstractWe present a method that reduces the problem of computing the radical of a matrix algebra ov...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a...
AbstractIn this paper we are concerned with the computation of prime decompositions of radicals in p...
AbstractLet F be a finite subset of the differential polynomial algebra k { y 1,⋯ , yn } . In order ...
AbstractIn this paper we investigate how algorithms for computing heights, radicals, unmixed and pri...
This paper deals with systems of polynomial differential equations, ordinary or with partial derivat...
O objetivo deste trabalho e computar, em alguns casos espec cos, os geradores do radical de um ideal...
Given a zero-dimensional ideal I in a polynomial ring, many algorithms start by finding univariate p...