On the Resolution of F(x,y)=G(x,y)
✍ Scribed by István Gaál
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 222 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
Let (F(x, y), G(x, y) \in \mathbf{Z}[x, y]) be polynomials of degree (n) and (m), respectively. Assume, that (F) is homogeneous and (n-m \geq 3). We give a fast algorithm for the resolution of the inequality (|F(x, y)| \leq|G(x, y)|) in (x, y \in \mathbf{Z}, \max (|x|,|y|)<C). We illustrate the method by solving (\left|x^{5}-x y^{4}-y^{5}\right| \leq 200\left(x^{2}+y^{2}\right), \max (|x|,|y|) \leq 10^{500}).
📜 SIMILAR VOLUMES
The splice quotients, defined by W. D. Neumann and J. Wahl, are an interesting class of normal surface singularities with rational homology sphere links. In general, it is difficult to determine whether or not a singularity is analytically isomorphic to a splice quotient, although there are certain
Let X and Y be limit spaces (in the sense of FISCHER). For f E C ( X , Y), let [ f ] denote the subset of C ( X , Y), where the maps take the connected components of X into those of Y quite analogously to f. The subspace [ f ] of the continuous convergence space C,(X, Y) is written as a product 17 C