Skip to main navigation Skip to search Skip to main content

Computation of the decomposition group of a triangular ideal

  • I. Abdeljaouad-Tej
  • , S. Orange
  • , G. Renault
  • , A. Valibouze
  • URPAH Research Group
  • LIP6, UPMC Sorbonne Universités - Paris 6

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)279-294
Number of pages16
JournalApplicable Algebra in Engineering, Communication and Computing
Volume15
Issue number3-4
DOIs
Publication statusPublished - 1 Nov 2004
Externally publishedYes

Keywords

  • Strong Generating Set
  • Triangular Ideal

Fingerprint

Dive into the research topics of 'Computation of the decomposition group of a triangular ideal'. Together they form a unique fingerprint.

Cite this