On the analytic complexity of discriminants
Informatics and Automation, Analytic and geometric issues of complex analysis, Tome 279 (2012), pp. 86-101
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{TRSPY_2012_279_a7,
author = {V. A. Krasikov and T. M. Sadykov},
title = {On the analytic complexity of discriminants},
journal = {Informatics and Automation},
pages = {86--101},
publisher = {mathdoc},
volume = {279},
year = {2012},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TRSPY_2012_279_a7/}
}
V. A. Krasikov; T. M. Sadykov. On the analytic complexity of discriminants. Informatics and Automation, Analytic and geometric issues of complex analysis, Tome 279 (2012), pp. 86-101. http://geodesic.mathdoc.fr/item/TRSPY_2012_279_a7/