ID: 1211.3588

Computation of Galois groups of rational polynomials

November 15, 2012

View on ArXiv

Similar papers 3

Galois Groups in Enumerative Geometry and Applications

August 18, 2021

85% Match
Frank Sottile, Thomas Yahl
Algebraic Geometry

As Jordan observed in 1870, just as univariate polynomials have Galois groups, so do problems in enumerative geometry. Despite this pedigree, the study of Galois groups in enumerative geometry was dormant for a century, with a systematic study only occuring in the past 15 years. We discuss the current directions of this study, including open problems and conjectures.

Find SimilarView on arXiv

Computing isomorphisms and embeddings of finite fields

May 3, 2017

85% Match
Ludovic Brieulle, Feo Luca De, Javad Doliskani, ... , Schost Éric
Symbolic Computation
Mathematical Software
Number Theory

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field embedding of $\mathbb{F}_q[X]/f(X)$ into $\mathbb{F}_q[Y]/g(Y)$. When $\mathrm{deg} f = \mathrm{deg} g$, this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in comput...

Find SimilarView on arXiv

Additive Polynomials for Finite Groups of Lie Type

June 7, 2009

85% Match
Maximilian Albert, Annette Maier
Group Theory
Representation Theory

This paper provides a realization of all classical and most exceptional finite groups of Lie type as Galois groups over function fields over F_q and derives explicit additive polynomials for the extensions. Our unified approach is based on results of Matzat which give bounds for Galois groups of Frobenius modules and uses the structure and representation theory of the corresponding connected linear algebraic groups.

Find SimilarView on arXiv

Linear groups and computation

May 15, 2018

85% Match
A. S. Detinko, D. L. Flannery
Group Theory

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed. This article is aimed at a broad mathematical audience, and more part...

Find SimilarView on arXiv

Constructions using Galois Theory

October 3, 2020

85% Match
Claus Fieker, Nicole Sutherland
Number Theory

We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group computations for this task. We also describe the computation of geometric Galois groups (monodromy groups) and their use in computing absolute factorizations.

Find SimilarView on arXiv

A Note on a Standard Model for Galois Rings

September 16, 2021

85% Match
E. Martínez-Moro, A. Piñera-Nicolás, I. F. Rúa
Rings and Algebras

In this work, we present a standard model for Galois rings based on the standard model of their residual fields, that is, a sequence of Galois rings starting with ${\mathbb Z}_{p^r} that coves all the Galois rings with that characteristic ring and such that there is an algorithm producing each member of the sequence whose input is the size of the required ring.

Find SimilarView on arXiv

Galois groups of random polynomials over the rational function field

March 18, 2024

84% Match
Alexei Entin
Number Theory

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials in $\mathbb F_q[t]$ of degree $\le d$. We show that with probability tending to 1 as $n\to\infty$ the Galois group $G_f$ of $f$ over $\mathbb F_q(t)$ is isomorphic to $S_{n-k}\times C$, where $C$ is cyclic, $k$ and $|C|$ are small quantitie...

Find SimilarView on arXiv

On decomposition of tame polynomials and rational functions

April 10, 2008

84% Match
Jaime Gutierrez, David Sevilla
Symbolic Computation
Commutative Algebra

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial, proving it for arbitrary tame polynomials, and considering the case of rational functions.

Find SimilarView on arXiv

On Galois realizations of the 2-coverable symmetric and alternating groups

August 18, 2010

84% Match
Daniel Rabayev, Jack Sonn
Number Theory

Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q_p for all p, or equivalently, with roots mod n for all n. It is known that f(x) cannot be irreducible but can be a product of two or more irreducible polynomials, and that if f(x) is a product of m>1 irreducible polynomials, then its Galois group must be "m-coverable", i.e. a union of conjugates of m proper subgroups, whose total intersection is trivial. We are thus led to a variant of the inver...

Find SimilarView on arXiv

Minimal ramification and the inverse Galois problem over the rational function field $\mathbb{F}_p(t)$

October 30, 2014

84% Match
Witt Meghan De
Number Theory

The inverse Galois problem is concerned with finding a Galois extension of a field $K$ with given Galois group. In this paper we consider the particular case where the base field is $K=\F_p(t)$. We give a conjectural formula for the minimal number of primes, both finite and infinite, ramified in $G$-extensions of $K$, and give theoretical and computational proofs for many cases of this conjecture.

Find SimilarView on arXiv