Related papers: On Galois Groups of Prime Degree Polynomials with …
Let K be a number field, t a parameter, F=K(t) and f in K[x] a polynomial of degree d. The polynomial P_n(x,t)= f^n(x) - t in F[x] where f^n is the n-fold iterate of f, is absolutely irreducible over F; we compute a recursion for its…
Given an abelian algebraic group $A$ over a global field $F$, $\alpha \in A(F)$, and a prime $\ell$, the set of all preimages of $\alpha$ under some iterate of $[\ell]$ generates an extension of $F$ that contains all $\ell$-power torsion…
A group of order $p^n$ ($p$ prime) has an indecomposable polynomial invariant of degree at least $p^{n-1}$ if and only if the group has a cyclic subgroup of index at most $p$ or it is isomorphic to one of two particular groups of small…
The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…
Given an irreducible bivariate polynomial $f(t,x)\in \mathbb{Q}[t,x]$, what groups $H$ appear as the Galois group of $f(t_0,x)$ for infinitely many $t_0\in \mathbb{Q}$? How often does a group $H$ as above appear as the Galois group of…
We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
We prove many new cases of the Inverse Galois Problem for those simple groups arising from orthogonal groups over finite fields. For example, we show that the finite simple groups Omega_{2n+1}(p) and POmega_{4n}^+(p) both occur as the…
Let p be a prime number and M a quadratic number field, M not equal to Q(\sqrt{p}) if p is congruent to 1 modulo 4. We will prove that for any positive integer d there exists a Galois extension F/Q with Galois group D_{2p} and an elliptic…
Let K be a number field, and let lambda(x,t)\in K[x, t] be irreducible over K(t). Using algebraic geometry and group theory, we study the set of alpha\in K for which the specialized polynomial lambda(x,alpha) is K-reducible. We apply this…
We compute the first explicit polynomials with Galois groups $G=P\Gamma L_3(4)$, $PGL_3(4)$, $PSL_3(4)$ and $PSL_5(2)$ over $\mathbb{Q}(t)$. Furthermore we compute the first examples of totally real polynomials with Galois groups…
We compute the Galois groups for a certain class of polynomials over the the field of rational numbers that was introduced by S. Mori and study the monodromy of corresponding hyperelliptic jacobians.
Let p>2 be prime, and let n,m be positive integers. For cyclic field extensions E/F of degree p^n that contain a primitive pth root of unity, we show that the associated F_p[Gal(E/F)]-modules H^m(G_E,mu_p) have a sparse decomposition. When…
In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…
In his paper titled "Torsion points on Fermat Jacobians, roots of circular units and relative singular homology", Anderson determines the homology of the degree $n$ Fermat curve as a Galois module for the action of the absolute Galois group…
Current techniques for formally verifying circuits implemented in Galois field (GF) arithmetic are limited to those with a known irreducible polynomial P(x). This paper presents a computer algebra based technique that extracts the…
Let $n=2g+2$ be a positive even integer, $f(x)$ a degree $n$ complex polynomial without multiple roots and $C_f: y^2=f(x)$ the corresponding genus $g$ hyperelliptic curve over the field $\C$ of complex numbers. Let a $(g-1)$-dimensional…
We address two interrelated problems concerning the permutation of roots of univariate polynomials whose coefficients depend on parameters. First, we compute the Galois group of polynomials $\varphi(x)\in\mathbb{C}[y_1,\cdots,y_k][x]$ over…
We propose an approach for the computation of multi-parameter families of Galois extensions with prescribed ramification type. More precisely, we combine existing deformation and interpolation techniques with recently developed strong tools…