Computation of the decomposition group of a triangular ideal

DOI10.1007/s00200-004-0160-xzbMath1088.13011OpenAlexW2073749170MaRDI QIDQ1762559

I. Abdeljaouad-Tej, Guénaël Renault, Annick Valibouze, Sébastien Orange

Publication date: 9 February 2005

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-004-0160-x

zbMATH Keywords

algorithmexponential complexitystrong generating setsGalois idealtriangular ideals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Separable extensions, Galois theory (12F10) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials in general fields (irreducibility, etc.) (12E05) Subgroups of symmetric groups (20B35)

Related Items (2)

Efficient arithmetic in successive algebraic extension fields using symmetries ⋮ Homotopy techniques for multiplication modulo triangular sets

Uses Software

• Magma

Cites Work

• Unnamed Item
• Fundamental algorithms for permutation groups
• The Magma algebra system. I: The user language
• Study of algebraic relations between the roots of a univariate polynomial
• The transitive groups of degree up to eleven⁺
• Using Galois ideals for computing relative resolvents

This page was built for publication: Computation of the decomposition group of a triangular ideal