微分Nash函数的Leibniz复杂性
Leibniz complexity of Nash functions on differentiations
摘要:
Nash函数的导数是由其极小多项式方程代数地导出的Nash函数。本文证明了对于任何非Nash解析函数,都不可能用代数方法导出其导数,即,利用线性和有限次莱布尼茨法则。事实上,我们证明了这种代数计算的不可能性,代数地使用K{\”a}hler微分。然后引入了Nash函数的Leibniz复杂性的概念,作为Nash函数导数的计算复杂性,通过用Leibniz规则代数地计算全微分的最少次数来表示。我们提供了一般的观察和上估计的莱布尼兹复杂性的纳什函数,有关的二进制扩展,添加链的复杂性,非标量复杂性和复杂性的纳什函数在Ramanakoraisina的意义。
英文摘要:
The derivatives of Nash functions are Nash functions which are derived algebraically from their minimal polynomial equations. In this paper we show that, for any non-Nash analytic function, it is impossible to derive its derivatives algebraically, i.e., by using linearity and Leibniz rule finite times. In fact we prove the impossibility of such kind of algebraic computations, algebraically by using K{\" a}hler differentials. Then the notion of Leibniz complexity of a Nash function is introduced in this paper, as a computational complexity on its derivative, by the minimal number of usages of Leibniz rules to compute the total differential algebraically. We provide general observations and upper estimates on Leibniz complexity of Nash functions, related to the binary expansions, the addition chain complexity, the non-scalar complexity and the complexity of Nash functions in the sense of Ramanakoraisina.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。