Skip to main content
SpringerLink
Log in

On the analytic complexity of discriminants

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

The paper deals with the notion of analytic complexity introduced by V.K. Beloshapka. We give an algorithm which allows one to check whether a bivariate analytic function belongs to the second class of analytic complexity. We also provide estimates for the analytic complexity of classical discriminants and introduce the notion of analytic complexity of a knot.

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. A. G. Vitushkin, “On Hilbert’s Thirteenth Problem and Related Questions,” Usp. Mat. Nauk 59(1), 11–24 (2004) [Russ. Math. Surv. 59, 11–25 (2004)].

    MathSciNet  Google Scholar 

  2. C. C. Adams, The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots (Freeman, New York, 1994).

    MATH  Google Scholar 

  3. S. B. Bank and R. P. Kaufman, “A Note on Hölder’s Theorem concerning the Gamma Function,” Math. Ann. 232, 115–120 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  4. V. K. Beloshapka, “Analytic Complexity of Functions of Two Variables,” Russ. J. Math. Phys. 14(3), 243–249 (2007).

    Article  MathSciNet  MATH  Google Scholar 

  5. F. Beukers and G. Heckman, “Monodromy for the Hypergeometric Function n F n−1,” Invent. Math. 95, 325–354 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  6. I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants (Birkhäuser, Boston, 1994).

    Book  MATH  Google Scholar 

  7. A. Grothendieck, “Esquisse d’un programme (Sketch of a Programme),” in Geometric Galois Actions, Vol. 1: Around Grothendieck’s “Esquisse d’un programme” (Cambridge Univ. Press, Cambridge, 1997), LMS Lect. Note Ser. 242, pp. 5–48, 243–283.

    Google Scholar 

  8. A. Ostrowski, “Über Dirichletsche Reihen und algebraische Differentialgleichungen,” Math. Z. 8, 241–298 (1920).

    Article  MathSciNet  MATH  Google Scholar 

  9. M. Passare, T. Sadykov, and A. Tsikh, “Singularities of Hypergeometric Functions in Several Variables,” Compos. Math. 141(3), 787–810 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  10. A. Zupan, “Bridge and Pants Complexities of Knots,” arXiv: 1110.3019 [math.GT].

Download references

Author information

Authors and Affiliations

  1. Siberian Federal University, Svobodnyi pr. 79, Krasnoyarsk, 660041, Russia

    V. A. Krasikov

  2. Russian State University of Trade and Economics, ul. Smol’naya 36, Moscow, 125993, Russia

    T. M. Sadykov

Authors
  1. V. A. Krasikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. M. Sadykov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Published in Russian in Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2012, Vol. 279, pp. 86–101.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krasikov, V.A., Sadykov, T.M. On the analytic complexity of discriminants. Proc. Steklov Inst. Math. 279, 78–92 (2012). https://doi.org/10.1134/S0081543812080081

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543812080081

Keywords

Search

Navigation