We first define the notion of the infimum at infinity of a polynomial function and the notion of stability at infinity near the fiber of the gradient descent system. Then we prove that the gradient descent system is stable at infinity near the fiber of the infimum value at infinity.
On the zeta-function of a polynomial at infinity
✍ Scribed by Sabir M. Gusein-Zade; Ignacio Luengo; Alejandro Melle-Hernández
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- French
- Weight
- 100 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0007-4497
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We correct a previously published theorem by proving a criterion to decide whether the ÿbration given by a real polynomial function f : R 2 → R is locally trivial at inÿnity. The algorithmical nature of this criterion provides a test that can be applied to any real polynomial f.
In this paper we define the relation of analytic equivalence of functions at infinity. We prove that if the Łojasiewicz exponent at infinity of the gradient of a polynomial f ∈ R[x 1 , . . . , x n ] is greater or equal to k -1, then there exists ε > 0 such that for every polynomial P ∈ R[x 1 , . . .
The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num