Advertisement

Beyond the First Class of Analytic Complexity

  • T. M. SadykovEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11077)

Abstract

We investigate the notion of analytic complexity of a bivariate holomorphic function by means of computer algebra tools. An estimate from below on the number of terms in the differential polynomials defining classes of analytic complexity is established. We provide an algorithm which allows one to explicitly compute the differential membership criteria for certain families of bivariate analytic functions in the second complexity class. The presented algorithm is implemented in the computer algebra system Singular 4-1-1.

Keywords

Analytic complexity Differential polynomial Differentially algebraic function 

Notes

Acknowledgments

This research has been performed in the framework of the basic part of the scientific research state task in the field of scientific activity of the Ministry of Education and Science of the Russian Federation, project No. 2.9577.2017/8.9.

References

  1. 1.
    Arnold, V.I.: On the representation of continuous functions of three variables by superpositions of continuous functions of two variables. Mat. Sb. 48(1), 3–74 (1959)MathSciNetGoogle Scholar
  2. 2.
    Beloshapka, V.K.: Analytic complexity of functions of two variables. Russ. J. Math. Phys. 14(3), 243–249 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Beloshapka, V.K.: Algebraic functions of complexity one, a Weierstrass theorem, and three arithmetic operations. Russ. J. Math. Phys. 23(3), 343–347 (2016)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Boulier, F., Lemaire, F., Maza, M.: Computing differential characteristic sets by change of ordering. J. Symb. Comput. 45(1), 124–149 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Dickenstein, A., Sadykov, T.M.: Algebraicity of solutions to the Mellin system and its monodromy. Dokl. Math. 75(1), 80–82 (2007)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Krasikov, V.A., Sadykov, T.M.: On the analytic complexity of discriminants. Proc. Steklov Inst. Math. 279, 78–92 (2012)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Mansfield, E.L.: Differential Gröbner bases. Ph.D. thesis, University of Sydney (1991)Google Scholar
  8. 8.
    Neuman, F.: Factorizations of matrices and functions of two variables. Chechoslovak Math. J. 32(4), 582–588 (1982)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Neuman, F.: Finite sums of products of functions in single variables. Linear Algebra Appl. 134, 153–164 (1990)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Robertz, Daniel: Formal Algorithmic Elimination for PDEs. LNM, vol. 2121. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-11445-3CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Plekhanov Russian UniversityMoscowRussia

Personalised recommendations