Skip to main content
SpringerLink
Log in

A complete algorithm for automated discovering of a class of inequality-type theorems

  • Scientific Papers
  • Published:
Science in China Series F Information Sciences Aims and scope Submit manuscript

Abstract

Making use of the discriminant sequence for polynomials, WR algorithm, Wu’s elimination and a partial cylindrical algebraic decomposition, we present here a practical algorithm for automated inequality discovering which can discover new inequalities automatically without requiring to put forward any conjectures beforehand. That is complete for an extensive class of inequality-type theorems. Also this algorithm is applied to the classification of the real physical solutions of geometric constraint problems. Many inequalities with various backgrounds have been discovered or rediscovered by our program, DISCOVERER, which implements the algorithm in Maple.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Folke, E., Which triangles are plane sections of regular tetrahedra? American Mathematical Monthly, Oct., 1994, 788.

  2. Guy, R. K., Nowakowski, R. J., Monthly Unsolved Problems, 1969–1997, American Mathematical Monthly, Dec., 1997, 967.

  3. Yang, L., Zhang, J. Z., Hou, X. R., An efficient decomposition algorithm for geometry theorem proving without factorization, in Proceedings of Asian Symposium on Computer Mathematics 1995 (eds. Shi, H., Kobayashi, H.), Scientists Incorporated Japan, 1995, 33–41.

  4. Yang, L., Zhang, J. Z., Hou, X. R., Nonlinear Algebraic Equation System and Automated Theorem Proving (in Chinese), Shanghai: Shanghai Scientific and Technological Education Publishing House, 1996.

    Google Scholar 

  5. Yang, L., Xia, B. C., Explicit criterion to determine the number of positive roots of a polynomial, MM Research Preprints, 1997, (15): 134–145.

  6. Liang, S. X., Zhang, J. Z., A complete discrimination system for polynomials with complex coefficients and its automatic generation, Science in China, Series E, 1999, 42(2): 113.

    MATH  MathSciNet  Google Scholar 

  7. Yang, L., Recent advances on determining the number of real roots of parametric polynomials, Journal of Symbolic Computation, 1999, 28: 225.

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhu, S. M., Wu, X. M., Computer application to ordinary differential equations and soliton, Mathematical Technology for 21st Century (eds. Yang, L., Liang, S. X.) (in Chinese), Guangzhou: Guangdong Economy Publishing House, 1999, 32–39.

    Google Scholar 

  9. Wang, L., Yu, W. S., Complete characterization of strictly positive real regions and robust strictly positive real synthesis method, Science in China, Series E, 2000, 43(1): 97.

    Article  MATH  MathSciNet  Google Scholar 

  10. Yang, L., Hou, X. R., Zeng, Z. B., A complete discrimination system for polynomials, Science in China, Series E, 1996, 39(6): 628.

    MATH  MathSciNet  Google Scholar 

  11. Chen, M., Generalization of discrimination system for polynomials and its applications, Ph. D Dissertation, Sichuan Union University, 1998.

  12. González-Vega, L., Lombardi, H., Recio, T. et al., Sturm-Habicht sequence, in Proc. of ISSAC’89, New York: ACM Press, 1989, 136–146.

    Google Scholar 

  13. Arnon, D. S., Collins, G. E., McCallum, S., Cylindrical algebraic decomposition I: The basic algorithm, SIAM J. Comput., 1984, 13(4): 865.

    Article  MathSciNet  Google Scholar 

  14. Arnon, D. S., Collins, G. E., McCallum, S., Cylindrical algebraic decomposition II: An adjacency algorithm for the Plane, SIAM J. Comput., 1984, 13(4): 878.

    Article  MathSciNet  Google Scholar 

  15. Winkler, F., Polynomial Algorithms in Computer Algebra, Wien: Springer-Verlag, 1996.

    MATH  Google Scholar 

  16. Wu, W. T., On the decision problem and the mechanization of theorem-proving in elementary geometry, Sci. Sinica, 1978, 21: 159.

    MATH  MathSciNet  Google Scholar 

  17. Wu, W. T., Mechanical Theorem Proving in Geometries: Basic Principles, Berlin: Springer-Verlag, 1994.

    MATH  Google Scholar 

  18. Gao, X. S., Cheng, H. F., On the solution classification of the “P3P” problem, in Proc. of ASCM’98 (ed. Li, Z.), Lanzhou: Lanzhou University Press, 1998, 185–200.

    Google Scholar 

  19. Yang, L., A simplified algorithm for solution classification of the perspective-three-point problem, MM Research Preprints, Beijing, 1998, 135.

  20. Mitrinovic, D. S., Pecaric, J. E., Volenec, V., Recent Advances in Geometric Inequalities, Amsterdam: Kluwer Academic Publishers, 1989.

    MATH  Google Scholar 

  21. Briggs, W. E., Zeros and factors of polynomials with positive coefficients and protein-ligand binding, Rocky Mountain Journal of Mathematics, 1985, 15(1): 75.

    Article  MATH  MathSciNet  Google Scholar 

  22. Wyman, J., The Binding potential, A neglected linkage concept, J. Mol. Biol., 1965, 11: 631.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chengdu Institute of Computer Applications, Chinese Academy of Sciences, 610041, Chengdu, China

    Yang Lu & Hou Xiaorong

  2. School of Mathematical Sciences, Peking University, 100871, Beijing, China

    Xia Bican

Authors
  1. Yang Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hou Xiaorong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xia Bican
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, L., Hou, X. & Xia, B. A complete algorithm for automated discovering of a class of inequality-type theorems. Sci China Ser F 44, 33–49 (2001). https://doi.org/10.1007/BF02713938

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02713938

Keywords

Search

Navigation