Computing the decomposition group of a zero-dimensional ideal by elimination method

01/22/2016
by   Yongbin Li, et al.
0

In this note, we show that the decomposition group Dec(I) of a zero-dimensional radical ideal I in K[x_1,...,x_n] can be represented as the direct sum of several symmetric groups of polynomials based upon using Gröbner bases. The new method makes a theoretical contribution to discuss the decomposition group of I by using Computer Algebra without considering the complexity. As one application, we also present an approach to yield new triangular sets in computing triangular decomposition of polynomial sets P if Dec(< P>) is known.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2022

On primary decomposition of Hermite projectors

An ideal projector on the space of polynomials ℂ [𝐱]=ℂ [x_1,… ,x_d] is a...
research
02/12/2022

Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems

Triangular decomposition with different properties has been used for var...
research
08/27/2015

Algebraic Local Cohomology with Parameters and Parametric Standard Bases for Zero-Dimensional Ideals

A computation method of algebraic local cohomology with parameters, asso...
research
01/13/2020

Solving Decomposable Sparse Systems

Amendola et al. proposed a method for solving systems of polynomial equa...
research
11/10/2019

Implementing geometric complexity theory: On the separation of orbit closures via symmetries

Understanding the difference between group orbits and their closures is ...
research
02/17/2023

Elimination ideal and bivariate resultant over finite fields

A new algorithm is presented for computing the largest degree invariant ...
research
09/11/2020

Guessing Gröbner Bases of Structured Ideals of Relations of Sequences

Assuming sufficiently many terms of a n-dimensional table defined over a...

Please sign up or login with your details

Forgot password? Click here to reset