Skip to main content
SpringerLink
Log in

Characteristic Set Method for Laurent Differential Polynomial Systems

  • Conference paper
  • First Online:
Book cover Computer Algebra in Scientific Computing (CASC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10490))

Included in the following conference series:

Abstract

In this paper, a characteristic set method for Laurent (differential) polynomial systems is given. In the Laurent polynomial case, the concept of Laurent regular chain is introduced and a characteristic set algorithm for Laurent polynomial system is given. In the Laurent differential polynomial case, we give a partial method to decide whether a Laurent differential chain \({\mathscr {A}}\) is Laurent regular.

Partially supported by an NSFC grant No. 11688101.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aubry, P., Lazard, D., Maza, M.M.: On the theories of triangular sets. J. Symb. Comput. 28, 105–124 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Boulier, F., Lemaire, F., Maza, M.M.: Computing differential characteristic sets by change of ordering. J. Symb. Comput. 45, 124–149 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bouziane, D., Kandri Rody, A., Maârouf, H.: Unmixed-dimensional decomposition of a finitely generated perfect differential ideal. J. Symb. Comput. 31, 631–649 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cano, J.: An extension of the Newton-Puiseux polygon construction to give solutions of Pfaffian forms. Ann. Inst. Fourier 43, 125–142 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cano, J.: On the series defined by differential equations, with an extension of the Puiseux polygon construction to these equations. Analysis 13, 103–120 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen, C., Davenport, J.H., May, J.P., Maza, M.M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. J. Symb. Comput. 49, 3–26 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chou, S.-C., Gao, X.-S.: Ritt-Wu’s decomposition algorithm and geometry theorem proving. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 207–220. Springer, Heidelberg (1990). doi:10.1007/3-540-52885-7_89

    Chapter  Google Scholar 

  8. Chou, S.C., Gao, X.S.: Automated reasoning in differential geometry and mechanics: part I. An improved version of Ritt-Wu’s decomposition algorithm. J. Autom. Reason. 10, 161–172 (1993)

    Article  MATH  Google Scholar 

  9. Gao, X.S., Huang, Z.: Characteristic set algorithms for equation solving in finite fields. J. Symb. Comput. 47, 655–679 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gao, X.S., Huang, Z., Yuan, C.M.: Binomial difference ideals. J. Symb. Comput. 80, 665–706 (2017)

    Article  MathSciNet  Google Scholar 

  11. Gao, X.S., Luo, Y., Yuan, C.: A characteristic set method for difference polynomial systems. J. Symb. Comput. 44, 242–260 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Grigoriev, D.Y., Singer, M.: Solving ordinary differential equations in terms of series with real exponents. Trans. AMS 327, 329–351 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hubert, E.: Factorization-free decomposition algorithms in differential algebra. J. Symb. Comput. 129, 641–662 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Li, W., Li, Y.H.: Computation of differential chow forms for ordinary prime differential ideals. Adv. Appl. Math. 72, 77–112 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Li, X., Mou, C., Wang, D.: Decomposing polynomial sets into simple sets over finite fields. Comput. Math. Appl. 60, 2983–2997 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Pauer, F., Unterkircher, A.: Gröbner bases for ideals in Laurent polynomial rings and their application to systems of difference equations. AAECC 9, 271–291 (1999)

    Article  MATH  Google Scholar 

  17. Sit, W.: The Ritt-Kolchin theory for diffferential polynomials. In: Differential Algebra and Related Topics, pp. 1–70 (2002)

    Google Scholar 

  18. Wang, D.: Elimination Methods. Springer Science & Business Media, Heidelberg (2012)

    Google Scholar 

  19. Wu, W.T.: Mathematics Mechanization. Science Press/Kluwer, Beijing (2001)

    Google Scholar 

  20. Wu, W.T., Gao, X.S.: Mathematics mechanization and applications after thirty years. Front. Comput. Sci. 1, 1–8 (2007)

    Article  Google Scholar 

  21. Yang, L., Zhang, J.: Searching dependency between algebraic equations. ICTP, IC/91/6 (1991)

    Google Scholar 

  22. Zampieri, S.: A solution of the Cauchy problem for multidimensional discrete linear shift-invariant systems. Linear Algebra Appl. 202, 143–162 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zhu, W., Gao, X.S.: A triangular decomposition algorithm for differential polynomial systems with elemenray complexity. J. Syst. Sci. Complex. 30, 464–483 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KLMM, UCAS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China

    Youren Hu & Xiao-Shan Gao

Authors
  1. Youren Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Shan Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Youren Hu .

Editor information

Editors and Affiliations

  1. Joint Institute of Nuclear Research, Dubna, Russia

    Vladimir P. Gerdt

  2. Universität Kassel, Kassel, Germany

    Wolfram Koepf

  3. Universität Kassel, Kassel, Germany

    Werner M. Seiler

  4. Russian Academy of Sciences, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Hu, Y., Gao, XS. (2017). Characteristic Set Method for Laurent Differential Polynomial Systems. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2017. Lecture Notes in Computer Science(), vol 10490. Springer, Cham. https://doi.org/10.1007/978-3-319-66320-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66320-3_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66319-7

  • Online ISBN: 978-3-319-66320-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation