We study the Hardy Littlewood method for the Laurent series field F q ((1รT )) over the finite field F q with q elements. We show that if \* 1 , \* 2 , \* 3 are non-zero elements in F q ((1รT )) satisfying \* 1 ร\* 2 ร F q (T ) and sgn(\* 1 )+sgn(\* 2 )+sgn(\* 3 )=0, then the values of the sum \* 1
Diophantine definitions for some polynomial rings
โ Scribed by Alexandra Shlapentokh
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 499 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We exhibit an algorithm computing, for a polynomial f โ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .
Let K be an algebraic number field such that all the embeddings of K into C are real. We denote by O K the ring of algebraic integers of K. Let F(X, Y) be an irreducible polynomial in K[X, Y ]&K[Y ] of total degree N and of degree n>0 in Y. We denote by F N (X, Y ) its leading homogeneous part. Supp
In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1)-tuple P = ( f, g 1 , g 2
R: \_P=P \\_ # S n ] and let + and & be hook shape partitions of n. With 2 + (X, Y ) and 2 & (Z, W ) being appropriately defined determinants, x i being the partial derivative operator with respect to x i and P( )=P( x 1 , ..., x n , y 1 , ..., w n ), define A basis is constructed for the polynomia
Let H n be the set of all algebraic polynomials with real coefficients of degree at most n(n+1 # N).