Degenerate polynomial forms
β Scribed by Barrett, K. E.
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 69 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1069-8299
No coin nor oath required. For personal study only.
β¦ Synopsis
It is well known that the condition under which a quadratic in two variables reduces to a product of two linear factors is that the determinant of the associated quadratic form should be zero. This result is generalized to the case of a polynomial of degree n. For the degree n case there are 1 2 n Γ 1n constraints for the polynomial to be reducible. A recursive algorithm is presented for determining them.
π SIMILAR VOLUMES
Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F . Our techniques allow us to sharpen and lower prior complexity bounds for this
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a polynomial and its derivative, a polynomial at two points, a polynomial of high degree using multiple precision arithmetic, and a bivariate polynomial of the form ~a(i)xiy "-i are presented. Various "coe
In this paper we introduce s-degenerate curves in Lorentzian space forms as those ones whose derivative of order s is a null vector provided that s > 1 and all derivatives of order less than s are space-like (see the exact definition in Section 2). In this sense classical null curves are 1-degenerat