𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Testing a Bivariate Polynomial for Analytic Reducibility

✍ Scribed by Scott McCallum

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
618 KB
Volume
24
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

Let K be an algebraically closed field of characteristic zero. We present an efficient algorithm for determining whether or not a given polynomial f (x, y) in K[x, y] is analytically reducible over K at the origin. The algorithm presented is based upon an informal method sketched by Kuo (1989) which is in turn derived from ideas of Abhyankar (1988). The presentation contained herein emphasises the proofs of the algorithm's correctness and termination, and is suitable for computer implementation. A polynomial worst case time complexity bound is proved for a partial version of the algorithm.

πŸ“œ SIMILAR VOLUMES

A Test for Bivariate Symmetry of Depende
A Test for Bivariate Symmetry of Dependent Competing Risks
✍ J. V. Deshpande πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 504 KB

In the competing risks set up with two dependent competing risks let F(z, y) be the joint probability distribution of (X, Y), the notional times to failure under the two risks. Actual independent obaervations are ( T i , & ) , i=l, 2, ..., n where Tf=min(Xi, Yi) and & = I ( X c a Y f ) . To test Ho:

A REDUCE program for the integration of
A REDUCE program for the integration of differential polynomials
✍ Ayşe HΓΌmeyra Bilge πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 477 KB

A differential polynomial F[u] is a polynomial expression of the derivatives of the function u(x). A REDUCE program for the integration of differential polynomials is given. The program is tested on the computation of the conserved densities of polynomial evolution equations. Input and output from t