Implementing the Round Four maximal order algorithm
A fast algorithm for polynomial factorization over
We present an algorithm that returns a proper factor of a polynomial over the -adic integers (if is reducible over ) or returns a power basis of the ring of integers of (if is irreducible over ). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm.
The totally real extension of degree 6 with minimum discriminant.
On Wendt's determinant and Sophie Germain's theorem.
The totally real extension of degree 6 with minimum discriminant.
Determinants of Latin squares of order 8.
The extensions of degree 6 with minimum discriminant.
Page 1