𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Orthogonal of Cyclotomic Units in Positive Characteristic

✍ Scribed by Bruno Anglès

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
180 KB
Volume
79
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Index of Cyclotomic Units in Char
On the Index of Cyclotomic Units in Characteristicpand Its Applications
✍ Linsheng Yin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 437 KB

Let k be a global function field with the field of constants F q , where q= p n is a prime power. Let be a fixed place with degree d . In the case d =1, we constructed the extended group of cyclotomic units in a cyclotomic extention of (k, ) and calculated its index in the total unit group [Y]. In t

On Singular Curves in the Case of Positi
On Singular Curves in the Case of Positive Characteristic
✍ Edoardo Ballico 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

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

The Calculation of Radical Ideals in Pos
The Calculation of Radical Ideals in Positive Characteristic
✍ Gregor Kemper 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 257 KB

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 Pos
Computing the Radical of an Ideal in Positive Characteristic
✍ Ryutaroh Matsumoto 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 294 KB

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