Abstract:
The objective of this paper is to trace the increase in the complexity of the description of classes of analytic complexity (introduced by the author in previous works) under the passage from the class $Cl_1$ to the class $Cl_2$. To this end, two subclasses, $Cl_1^+$ and $Cl_1^{++}$, of $Cl_2$ that are not contained in $Cl_1$ are described from the point of view of the complexity of the differential equations determining these subclasses. It turns out that $Cl_1^+$ has fairly simple defining relations, namely, two differential polynomials of differential order $5$ and algebraic degree $6$ (Theorem 1), while a criterion for a function to belong to $Cl_1^{++}$ obtained in the paper consists of one relation of order $6$ and five relations of order $7$, which have degree $435$ (Theorem 2). The “complexity drop” phenomenon is discussed; in particular, those functions in the class $Cl_1^+$ which are contained in $Cl_1$ are explicitly described (Theorem 3).
Keywords:
superposition of analytic functions, analytic complexity, differential polynomials.
Citation:
V. K. Beloshapka, “On the Complextity of the Differential-Algebraic Description of Analytic Complexity Classes”, Mat. Zametki, 105:3 (2019), 323–331; Math. Notes, 105:3 (2019), 309–315
\Bibitem{Bel19}
\by V.~K.~Beloshapka
\paper On the Complextity of the Differential-Algebraic Description of Analytic Complexity Classes
\jour Mat. Zametki
\yr 2019
\vol 105
\issue 3
\pages 323--331
\mathnet{http://mi.mathnet.ru/mzm12056}
\crossref{https://doi.org/10.4213/mzm12056}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3920409}
\elib{https://elibrary.ru/item.asp?id=37045118}
\transl
\jour Math. Notes
\yr 2019
\vol 105
\issue 3
\pages 309--315
\crossref{https://doi.org/10.1134/S0001434619030015}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000467561600001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85065462347}
Linking options:
https://www.mathnet.ru/eng/mzm12056
https://doi.org/10.4213/mzm12056
https://www.mathnet.ru/eng/mzm/v105/i3/p323
This publication is cited in the following 5 articles:
V.K. Beloshapka, “Analytical Complexity and Signal Coding”, Russ. J. Math. Phys., 31:1 (2024), 44
V. K. Beloshapka, “Analytic Complexity: Functions with One-Dimensional Stabilizer in the Gauge Group”, Math. Notes, 115:5 (2024), 683–691
V. K. Beloshapka, “Geometric constructions in the theory of analytic complexity”, Izv. Math., 88:3 (2024), 411–418
Vitaly A. Krasikov, “Upper bounds for the analytic complexity of Puiseux polynomial solutions to bivariate hypergeometric systems”, Zhurn. SFU. Ser. Matem. i fiz., 13:6 (2020), 718–732
Krasikov V.A., “Analytic Complexity of Hypergeometric Functions Satisfying Systems With Holonomic Rank Two”, Computer Algebra in Scientific Computing (Casc 2019), Lecture Notes in Computer Science, 11661, eds. England M., Koepf W., Sadykov T., Seiler W., Vorozhtsov E., Springer International Publishing Ag, 2019, 330–342