Computing Independent Variable Sets for Polynomial Ideals

Zhuoran Yang, Chang Tan and Niansheng Tang

Journal of Mathematics, 2022, vol. 2022, 1-6

Abstract: 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. Based on the quasi-Gröbner basis of the extended ideal, a criterion of assigning independent variables is gained. According to the criteria, a maximal independent variable set for a polynomial ideal can be computed by assigning indeterminates gradually. The key point of the algorithm is to reduce dimensions so that the unit of computation is one variable instead of a set, which turns a multivariate problem into a single-variable problem and turns the computation of rational function field into that of the fundamental number field. Hence, the computation complexity is reduced. The algorithm has been analysed by an example, and the results reveal that the algorithm is correct and effective.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/7049980.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/7049980.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:7049980

DOI: 10.1155/2022/7049980

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().