Details:
Title  A characteristic set method for ordinary difference polynomial systems  Author(s)  Xiao Shan Gao, Yong Luo, C.M. Yuan  Type  Article in Journal  Abstract  We prove several basic properties for difference ascending chains, including a necessary and sufficient condition for an ascending chain to be the characteristic set of its saturation ideal and a necessary and sufficient condition for an ascending chain to be the characteristic set of a reflexive prime ideal. Based on these properties, we propose an algorithm to decompose the zero set of a finite set of difference polynomials into the union of zero sets of certain ascending chains. This decomposition algorithm is implemented and used to solve the perfect ideal membership problem, and to prove certain difference identities automatically.  Keywords  Difference polynomial, Ascending chain, Characteristic set, Coherence, Irreducibility, Zero decomposition theorem, Automated theorem proving  ISSN  07477171 
URL 
http://www.sciencedirect.com/science/article/pii/S0747717108001120 
Language  English  Journal  Journal of Symbolic Computation  Volume  44  Number  3  Pages  242  260  Year  2009  Note  Polynomial System Solving in honor of Daniel Lazard  Edition  0  Translation 
No  Refereed 
No 
