Deciding the nilpotency of the Galois group by computing elements in the centre
From MaRDI portal
Publication:4813623
DOI10.1090/S0025-5718-03-01620-XzbMath1065.11101OpenAlexW2065800794MaRDI QIDQ4813623
P. Fernández-Ferreirós, Maria Ángeles Gómez-Molleda
Publication date: 13 August 2004
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01620-x
Symbolic computation and algebraic computation (68W30) Galois theory (11R32) Algebraic number theory computations (11Y40)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact solution of linear equations using p-adic expansions
- Chebotarëv and his density theorem
- Efficient rational number reconstruction
- An inequality for the discriminant of a polynomial
- Computational verification of M11and M12as galois groups over Q
- A method for deciding whether the Galois group is abelian
- Factoring Polynomials over Algebraic Number Fields
- Computing automorphisms of abelian number fields
- Explicit bounds for primes in residue classes
- Number fields