Some Notes upon “When Does \(<{\mathbb T}>\) Equal Sat \(({\mathbb T})\)?”

  • Yongbin Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6167)

Abstract

Given a regular set \(\mathbb{T}\) in K[x], Lemaire et al. in ISSAC’08 give a nice algebraic property: the regular set \(\mathbb{T}\) generates its saturated ideal if and only if it is primitive. We firstly aim at giving a more direct proof of the above result, generalizing the concept of primitivity of polynomials and regular sets and presenting a new result which is equivalent to the above property. On the other hand, based upon correcting an error of the definition of U-set in AISC’06, we further develop some geometric properties of triangular sets. To a certain extent, the relation between the primitivity of \(\mathbb{T}\) and its U-set is also revealed in this paper.

Keywords

Regular sets saturated ideal weakly primitive C-primitive U-set 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. J. Symb. Comput. 28, 105–124 (1999)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Boulier, F., Lemaire, F., Moreno Maza, M.: Well known theorems on triangular systems and the D5 principle. In: Proc. of Transgressive Computing 2006 (2006)Google Scholar
  3. 3.
    Chen, C., Golubitsky, O., Lemaire, F., Maza, M.M., Pan, W.: Comprehensive triangular decomposition. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 73–101. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and algorithms. Springer, Heidelberg (1992)MATHGoogle Scholar
  5. 5.
    Dahan, X., Maza, M.M., Schost, E., Wu, W., Xie, Y.: Lifting techniques for triangular decompositions. In: Proceedings ISSAC 2005, Beijing, China (2005)Google Scholar
  6. 6.
    Lemaire, F., Moreno Maza, M., Pan, W., Xie, Y.: When does \(<{{\mathbb T}}> = { \rm sat}({\mathbb T})\)? In: Proceedings ISSAC 2008, pp. 207–214. ACM Press, New York (2008)CrossRefGoogle Scholar
  7. 7.
    Gao, X.-S., Chou, S.-C.: Computations with parametric equations. In: Proceedings ISAAC 1991, pp. 122–127 (1991)Google Scholar
  8. 8.
    Gao, X.-S., Chou, S.-C.: On the dimension of an arbitray ascending chain. Chin. Sci. Bull. 38, 799–804 (1993)MATHGoogle Scholar
  9. 9.
    Huang, F.-J.: Researches on Algorithms of Decomposition of Polynomial System. Ph.D. Thesis. Chengdu Institute of Computer Applications, China (2007)Google Scholar
  10. 10.
    Kalkbrener, M.: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comput. 15, 143–167 (1993)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Lazard, D.: A new method for solving algebraic systems of positive dimension. Discrete Appl. Math. 33, 147–160 (1991)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Li, Y.-B., Zhang, J.-Z., Yang, L.: Decomposing polynomial systems into strong regular sets. In: Cohen, A.M., Gao, X.-S., Takayama, N. (eds.) Proceedings ICMS 2002, pp. 361–371 (2002)Google Scholar
  13. 13.
    Li, Y.-B.: Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems. J. Symb. Comput. 38, 815–832 (2004)CrossRefGoogle Scholar
  14. 14.
    Li, Y.-B.: Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol. 4120, pp. 82–93. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  15. 15.
    Wang, D.: Computing triangular systems and regular systems. J. Symb. Comput. 30, 221–236 (2000)MATHCrossRefGoogle Scholar
  16. 16.
    Wang, D.: Elimination Methods. Springer, New York (2001)MATHGoogle Scholar
  17. 17.
    Wu, W.-T.: On the decision problem and the mechanization of theorem-proving in elementary geometry. Scientia Sinica 21, 159–172 (1978)MATHMathSciNetGoogle Scholar
  18. 18.
    Wu, W.-T.: On zeros of algebraic equations — An application of Ritt principle. Kexue Tongbao 31, 1–5 (1986)MATHGoogle Scholar
  19. 19.
    Yang, L., Zhang, J.-Z.: Search dependency between algebraic equations: An algorithm applied to automated reasoning. Technical Report ICTP/91/6, International Center For Theoretical Physics, International Atomic Energy Agency, Miramare, Trieste (1991)Google Scholar
  20. 20.
    Yang, L., Zhang, J.-Z., Hou, X.-R.: Non-Linear Equation Systems and Automated Theorem Proving. Shanghai Sci. & Tech. Education Publ. House, Shanghai (1996) (in Chinese)Google Scholar
  21. 21.
    Zhang, J.-Z., Yang, L., Hou, X.-R.: A note on Wu Wen-Tsün’s nondegenerate condition. Technical Report ICTP/91/160, International Center For Theoretical Physics, International Atomic Energy Agency, Miramare, Trieste (1991); Also in Chinese Science Bulletin, 38(1), 86–87 (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yongbin Li
    • 1
  1. 1.School of Applied MathematicUniversity of Electronic Science and Technology of ChinaChengdu, SichuanChina

Personalised recommendations