We propose an algorithm for computing the radical of a polynomial ideal in positive characteristic. The algorithm does not involve polynomial factorization.
Computing the Radical of an Ideal in Positive Characteristic
β Scribed by Ryutaroh Matsumoto
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 294 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
We propose a method for computing the radical of an arbitrary ideal in the polynomial ring in n variables over a perfect field of characteristic p > 0. In our method Buchberger's algorithm is performed once in n variables and a GrΓΆbner basis conversion algorithm is performed at most n log p d times in 2n variables, where d is the maximum of total degrees of generators of the ideal and 3. Next we explain how to compute radicals over a finitely generated coefficient field over a field K, when we have a radical computation method over the field K. Thus we can compute radicals over any finitely generated field over a perfect field.
π SIMILAR VOLUMES
We work over any algebraically closed field F. However the applications are not vacuos only if char (F) > 0. A finite set S in a projective space V is said to be in t-unifomn position, t an integer, if for any two subsets A , B of S with card it is in t-uniform position for every t. 9 is called in
Oscillations in normalized scan impedance across a finite array are much larger for the H-plane scan than for the E-plane scan. Addition of a ground screen further increases the amplitude of the oscillations. A forthcoming article models these in a Gibbs fashion.