Related papers: Galois Groups of Generic Polynomials

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

Let $m$ be an integer greater than three and $\ell$ be an odd prime. In this paper, we prove that at least one of the following groups: $\mbox{P}\Omega^\pm_{2m}(\mathbb{F}_{\ell^s})$, $\mbox{PSO}^\pm_{2m}(\mathbb{F}_{\ell^s})$,…

We revisit Kolchin's results on definability of differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. In certain classes of differential topological…

Let $f(x)=x^4+ax^3+d\in {\mathbb Z}[x]$, where $ad\ne 0$. Let $C_n$ denote the cyclic group of order $n$, $D_4$ the dihedral group of order 8, and $A_4$ the alternating group of order 12. Assuming that $f(x)$ is monogenic, we give necessary…

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

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…

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

This article is the third and last part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. This part proves the following new result for the inverse…

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

We show that the Galois group of the polynomial in the title is isomorphic to the full symmetric group on six symbols for all but finitely many $n$. This complements earlier work of Filaseta and Moy, who studied Galois groups of…

Given two monic polynomials f and g with coefficients in a number field K, and some a in K, we examine the action of the absolute Galois group of K on the directed graph of iterated preimages of a under the correspondence g(y)=f(x),…

For each finite subgroup $G$ of $PGL_2(\mathbb{Q})$, and for each integer $n$ coprime to $6$, we construct explicitly infinitely many Galois extensions of $\mathbb{Q}$ with group $G$ and whose ideal class group has $n$-rank at least…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

Define a random variable $\xi_n$ by choosing a conjugacy class $C$ of the Sylow $p$-subgroup of $S_{p^n}$ by random, and let $\xi_n$ be the logarithm of the order of an element in $C$. We show that $\xi_n$ has bounded variance and mean…

We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because…

Let $K$ be a number field, and let $d\geq 2$. A conjecture of Odoni (stated more generally for characteristic zero Hilbertian fields $K$) posits that there is a monic polynomial $f\in K[x]$ of degree $d$, and a point $x_0\in K$, such that…

For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has…