Page 1 Next

Displaying 1 – 20 of 968

Showing per page

A characterization of Eisenstein polynomials generating extensions of degree p 2 and cyclic of degree p 3 over an unramified 𝔭 -adic field

Maurizio Monge (2014)

Journal de Théorie des Nombres de Bordeaux

Let p 2 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 p 2 over p , and extend it to when the base fields K is an unramified extension of p .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...

A classification of the extensions of degree p 2 over p whose normal closure is a p -extension

Luca Caputo (2007)

Journal de Théorie des Nombres de Bordeaux

Let k be a finite extension of p and k be the set of the extensions of degree p 2 over k whose normal closure is a p -extension. For a fixed discriminant, we show how many extensions there are in p with such discriminant, and we give the discriminant and the Galois group (together with its filtration of the ramification groups) of their normal closure. We show how this method can be generalized to get a classification of the extensions in k .

A criterion for potentially good reduction in nonarchimedean dynamics

Robert L. Benedetto (2014)

Acta Arithmetica

Let K be a nonarchimedean field, and let ϕ ∈ K(z) be a polynomial or rational function of degree at least 2. We present a necessary and sufficient condition, involving only the fixed points of ϕ and their preimages, that determines whether or not the dynamical system ϕ: ℙ¹ → ℙ¹ has potentially good reduction.

A fast algorithm for polynomial factorization over p

David Ford, Sebastian Pauli, Xavier-François Roblot (2002)

Journal de théorie des nombres de Bordeaux

We present an algorithm that returns a proper factor of a polynomial Φ ( x ) over the p -adic integers p (if Φ ( x ) is reducible over p ) or returns a power basis of the ring of integers of p [ x ] / Φ ( x ) p [ x ] (if Φ ( x ) is irreducible over p ). 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.

A mean value theorem for the square of class number times regulator of quadratic extensions

Takashi Taniguchi (2008)

Annales de l’institut Fourier

Let k be a number field. In this paper, we give a formula for the mean value of the square of class number times regulator for certain families of quadratic extensions of k characterized by finitely many local conditions. We approach this by using the theory of the zeta function associated with the space of pairs of quaternion algebras. We also prove an asymptotic formula of the correlation coefficient for class number times regulator of certain families of quadratic extensions.

A monogenic Hasse-Arf theorem

James Borger (2004)

Journal de Théorie des Nombres de Bordeaux

I extend the Hasse–Arf theorem from residually separable extensions of complete discrete valuation rings to monogenic extensions.

Currently displaying 1 – 20 of 968

Page 1 Next