Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Computation of the Decomposition Group of a Triangular Ideal

I. Abdeljaouad-TejContact Information, S. OrangeContact Information, G. RenaultContact Information and A. ValibouzeContact Information

(1) École Supérieure de la Statistique et de lrsquoAnalyse de lrsquoInformation à lrsquoINSAT, Boulevard de la Terre, Zone Urbaine Nord Tunis, BP 675, 1080 Tunis, Tunisie
(2) LIP6 - Université Pierre et Marie Curie, 4, place Jussieu, 75005 Paris, France

Received: 1 July 2003  Revised: 10 June 2004  Published online: 15 October 2004

Abstract.  This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generated by a triangular system of generators.

Key words  Triangular Ideal - Strong Generating Set

Acknowledgement The authors would like to thank the anonymous referees for extensive comments on clarifying and improving the exposition of this paper and Laurence Bessis for her helpful suggestions and comments.

Contact InformationI. Abdeljaouad-Tej
Email: Ines.Abdeljaoued@insat.rnu.tn

Contact InformationS. Orange
Email: orange@calfor.lip6.fr

Contact InformationG. Renault
Email: renault@calfor.lip6.fr

Contact InformationA. Valibouze
Email: valibouze@calfor.lip6.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this article
Export this article as RIS | Text
 
Remote Address: 38.107.191.113 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)