# Computing strong regular characteristic pairs with Groebner bases

@article{Dong2021ComputingSR, title={Computing strong regular characteristic pairs with Groebner bases}, author={R. Dong and Dongming Wang}, journal={ArXiv}, year={2021}, volume={abs/1907.13537} }

The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced lexicographical Groebner basis, C is the W-characteristic set of the ideal , the saturated ideal sat(C) of C is equal to , and C is regular. In this paper, we show that for any polynomial ideal I with given generators one can either detect that I is unit, or… Expand

#### References

SHOWING 1-10 OF 38 REFERENCES

Decomposition of polynomial sets into characteristic pairs

- Computer Science, Mathematics
- Math. Comput.
- 2020

On lexicographic Groebner bases of radical ideals in dimension zero: interpolation and structure

- Computer Science, Mathematics
- ArXiv
- 2012

Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering

- Computer Science, Mathematics
- J. Symb. Comput.
- 1993

A New Algorithm for Discussing Gröbner Bases with Parameters

- Mathematics, Computer Science
- J. Symb. Comput.
- 2002

Characteristic Decomposition: From Regular Sets to Normal Sets

- Mathematics, Computer Science
- J. Syst. Sci. Complex.
- 2019

On the Connection Between Ritt Characteristic Sets and Buchberger–Gröbner Bases

- Computer Science, Mathematics
- Math. Comput. Sci.
- 2016

Doing algebraic geometry with the RegularChains library

- Computer Science
- ACCA
- 2015