Representation for the radical of a finitely generated differential ideal

F. Boulier; F. Ollivier; D. Lazard; M. Petitot

doi:10.1145/220346.220367

Representation for the radical of a finitely generated differential ideal

F. Boulier
, F. Ollivier
, D. Lazard
, M. Petitot

Université de Lille

Research output: Contribution to conference › Paper › peer-review

Abstract

We give an algorithm which represents the radical T of a finitely generated differential ideal as an intersection of radical differential ideals. The computed representation provides an algorithm for testing membership in T. This algorithm works over either an ordinary or a partial differential polynomial ring of characteristic zero. It has been programmed. We also give a method to obtain a characteristic set of T, if the ideal is prime.

Original language	English
Pages	158-166
Number of pages	9
DOIs	https://doi.org/10.1145/220346.220367
Publication status	Published - 1 Jan 1995
Externally published	Yes
Event	Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation - Montreal, Can Duration: 10 Jul 1995 → 12 Jul 1995

Conference

Conference	Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation
City	Montreal, Can
Period	10/07/95 → 12/07/95

Access to Document

10.1145/220346.220367

Cite this

@conference{14c291d3155a4855ac0dd88774189d58,

title = "Representation for the radical of a finitely generated differential ideal",

abstract = "We give an algorithm which represents the radical T of a finitely generated differential ideal as an intersection of radical differential ideals. The computed representation provides an algorithm for testing membership in T. This algorithm works over either an ordinary or a partial differential polynomial ring of characteristic zero. It has been programmed. We also give a method to obtain a characteristic set of T, if the ideal is prime.",

author = "F. Boulier and F. Ollivier and D. Lazard and M. Petitot",

year = "1995",

month = jan,

day = "1",

doi = "10.1145/220346.220367",

language = "English",

pages = "158--166",

note = "Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation ; Conference date: 10-07-1995 Through 12-07-1995",

}

TY - CONF

T1 - Representation for the radical of a finitely generated differential ideal

AU - Boulier, F.

AU - Ollivier, F.

AU - Lazard, D.

AU - Petitot, M.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We give an algorithm which represents the radical T of a finitely generated differential ideal as an intersection of radical differential ideals. The computed representation provides an algorithm for testing membership in T. This algorithm works over either an ordinary or a partial differential polynomial ring of characteristic zero. It has been programmed. We also give a method to obtain a characteristic set of T, if the ideal is prime.

AB - We give an algorithm which represents the radical T of a finitely generated differential ideal as an intersection of radical differential ideals. The computed representation provides an algorithm for testing membership in T. This algorithm works over either an ordinary or a partial differential polynomial ring of characteristic zero. It has been programmed. We also give a method to obtain a characteristic set of T, if the ideal is prime.

U2 - 10.1145/220346.220367

DO - 10.1145/220346.220367

M3 - Paper

AN - SCOPUS:0029182270

SP - 158

EP - 166

T2 - Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation

Y2 - 10 July 1995 through 12 July 1995

ER -

Representation for the radical of a finitely generated differential ideal

Abstract

Conference

Access to Document

Fingerprint

Cite this