Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ANTS
2006
Springer

favoriteEmaildiscussreport

95views Algorithms» more ANTS 2006»

Computing Pro-P Galois Groups

13 years 8 months ago

Computing Pro-P Galois Groups

Download www.math.wisc.edu

We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois group. In the infinite case it produces a family or few families of likely candidates.

Nigel Boston, Harris Nover

Real-time Traffic

Algorithms | ANTS 2006 | Explicit Computation | Galois Group | Tamely Ramified |

claim paper

Related Content

» Galois Group Computation for Rational Polynomials

» Lie symmetries and differential Galois groups of linear equations

» Around the numericsymbolic computation of differential Galois groups

» Computing the Galois group of a polynomial using linear differential equations

» Nonic 3adic Fields

» A Modular Method for Computing the Splitting Field of a Polynomial

» Computing monodromy via parallel homotopy continuation

» On the Resolution of Index Form Equations

» Automatically Proving Concurrent Programs Correct

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	ANTS
Authors	Nigel Boston, Harris Nover

Comments (0)