Computation of Galois groups of rational polynomials
نویسندگان
چکیده
منابع مشابه
Galois Group Computation for Rational Polynomials
We describe methods for the computation of Galois groups of univariate polynomials over the rationals which we have implemented up to degree 15. These methods are based on Stauduhar's algorithm. All computations are done in unramiied p-adic extensions. For imprimitive groups we give an improvement using subbelds. In the primitive case we use known subgroups of the Galois group together with a c...
متن کاملGalois groups of multivariate Tutte polynomials
The multivariate Tutte polynomial ẐM of a matroid M is a generalization of the standard two-variable version, obtained by assigning a separate variable ve to each element e of the ground set E. It encodes the full structure of M . Let v = {ve}e∈E , let K be an arbitrary field, and suppose M is connected. We show that ẐM is irreducible over K(v), and give three self-contained proofs that the Gal...
متن کاملComputation of Galois groups over function fields
Symmetric function theory provides a basis for computing Galois groups which is largely independent of the coefficient ring. An exact algorithm has been implemented over Q(t1, t2, . . . , tm) in Maple for degree up to 8. A table of polynomials realizing each transitive permutation group of degree 8 as a Galois group over the rationals is included.
متن کاملTechniques for the Computation of Galois Groups
This note surveys recent developments in the problem of computing Galois groups. Galois theory stands at the cradle of modern algebra and interacts with many areas of mathematics. The problem of determining Galois groups therefore is of interest not only from the point of view of number theory (for example see the article [39] in this volume), but leads to many questions in other areas of mathe...
متن کاملComputing Galois Groups with Generic Resolvent Polynomials
Given an arbitrary irreducible polynomial f with rational coefficients it is difficult to determine the Galois group of the splitting field of that polynomial. When the roots of f are easy to calculate, there are a number of “tricks” that can be employed to calculate this Galois group. If the roots of f are solvable by radicals, for example, it is often easy to calculate by hand the Q-fixing au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2014
ISSN: 1461-1570
DOI: 10.1112/s1461157013000302