Computing Independent Variable Sets for Polynomial Ideals
Computing independent variable sets for polynomial ideals plays an important role in solving high-dimensional polynomial equations. The computation of a Gröbner basis for an ideal, with respect to a block lexicographical order in classic methods, is huge, and then an improved algorithm is given. Bas...
Saved in:
| Main Authors: | Zhuoran Yang, Chang Tan |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/7049980 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Radical Structures of Fuzzy Polynomial Ideals in a Ring
by: Hee Sik Kim, et al.
Published: (2016-01-01) -
Bears with Hats and Independence Polynomials
by: Václav Blažej, et al.
Published: (2023-10-01) -
Effectiveness of similar sets of polynomials of two complex variables in polycylinders and in Faber regions
by: K. A. M. Sayyed, et al.
Published: (1998-01-01) -
A Note on Primitivity of Ideals in Skew Polynomial Rings of Automorphism Type
by: Edilson Soares Miranda
Published: (2016-01-01) -
The Selberg sieve method in the polynomial set
by: Gintautas Bareikis
Published: (2001-12-01)