Computation of the decomposition group of a triangular ideal

This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefﬁcients in a perfect ﬁeld when those ideals are generated by a triangular system of generators.

Keywords

Triangular Ideal Strong Generating Set

Domains

Symbolic Computation [cs.SC]

Annick Valibouze : Connect in order to contact the contributor

https://hal.sorbonne-universite.fr/hal-00556814

Submitted on : Monday, January 17, 2011-5:39:48 PM

Last modification on : Tuesday, April 11, 2023-3:16:28 PM

Dates and versions

hal-00556814 , version 1 (17-01-2011)

Identifiers

HAL Id : hal-00556814 , version 1
DOI : 10.1007/s00200-004-0160-x

Cite

Inès Abdeljaouad-Tej, Sébastien Orange, Guénaël Renault, Annick Valibouze. Computation of the decomposition group of a triangular ideal. Applicable Algebra in Engineering, Communication and Computing, 2004, 15 (3-4), pp.279--294. ⟨10.1007/s00200-004-0160-x⟩. ⟨hal-00556814⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UPMC CNRS LSTA LIP6 LPSM SORBONNE-UNIVERSITE SU-SCIENCES

87 View

0 Download