Efficient computation of maximal orders in radical (including Kummer) extensions (Q412222)

The author develops an algorithm for the computation of maximal orders in (relative) radical extensions. It is linear in the degree \(n\) of the extension. A detailed comparison with existing software shows that the new algorithm is superior to existing software in most cases. A main ingredient is the calculation of suitable bases for \(P\)-maximal orders which make the computation of the maximal order faster. For primes \(P\) of the radical extension which do not contain the degree \(n\) a basis of the \(P\)-maximal order can be easily calculated explicitly (Theorem 6). This is used to calculate a suitable pseudo basis of the \(P\)-maximal order with Algorithm 1. The structure of those bases for all relevant primes \(P\) then allows a fast calculation of the maximal order with Algorithm 2. It is followed by Algorithm 3 for the calculation of maximal orders for class fields via Kummer extensions. The author presents several illustrative examples. The last section contains tables with timings for the computation of maximal orders in global fields in which the new algorithm is compared with existing software.