Loading [MathJax]/extensions/MathZoom.js
Let be a prime. We derive a technique based on local class field theory and on the expansions of certain resultants allowing to recover very easily Lbekkouri’s characterization of Eisenstein polynomials generating cyclic wild extensions of degree over , and extend it to when the base fields is an unramified extension of .When a polynomial satisfies a subset of such conditions the first unsatisfied condition characterizes the Galois group of the normal closure. We derive a complete classification...
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.
Let be a cubic, monic and separable polynomial over a field of characteristic and let be the elliptic curve given by . In this paper we prove that the coefficient at in the –th division polynomial of equals the coefficient at in . For elliptic curves over a finite field of characteristic , the first coefficient is zero if and only if is supersingular, which by a classical criterion of Deuring (1941) is also equivalent to the vanishing of the second coefficient. So the zero loci...
We study the p-adic equation x q = a over the field of p-adic numbers. We construct an algorithm which gives a solvability criteria in the case of q = p m and present a computer program to compute the criteria for any fixed value of m ≤ p − 1. Moreover, using this solvability criteria for q = 2; 3; 4; 5; 6, we classify p-adic 6-dimensional filiform Leibniz algebras.
We develop a recursive method for computing the -removed -orderings and -orderings of order the characteristic sequences associated to these and limits associated to these sequences for subsets of a Dedekind domain This method is applied to compute these objects for and .
Dans cette note, nous montrons que la dynamique d’un polynôme quadratique sur un corps local peut être déterminée en temps fini, et que l’on a l’alternative suivante : soit l’ensemble de Julia est vide, soit y est conjugué au décalage unilatéral sur symboles.
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a -adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good.
Currently displaying 1 –
20 of
43