English
Related papers

Related papers: Probabilistic Galois Theory in Function Fields

200 papers

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…

History and Overview · Mathematics 2015-12-31 Fariba Ranjbar , Saeed Ranjbar

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

Probability · Mathematics 2024-09-12 Matthew C. King , Ashvin Swaminathan

Let $\F_q$ be a finite field of characteristic $p>0$. We prove that, given $F(t,x)\in \F_q[t][x]$ an irreducible separable monic polynomial in the variable $x$ and a generic monic polynomial $\phi(t)$ in the variable $t$, the polynomial…

Number Theory · Mathematics 2023-08-16 Sushma Palimar

Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_{A}(t)$ of a random matrix $A$ in $\mathrm{GL}_{n}(\mathbb{F}_{q})$ is square-free with $r$ (monic) irreducible factors…

Combinatorics · Mathematics 2022-09-09 Gilyoung Cheong , Jungin Lee , Hayan Nam , Myungjun Yu

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Number Theory · Mathematics 2020-08-05 Zeyu Guo

Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or…

Number Theory · Mathematics 2007-09-19 Oz Ben-Shimol

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Number Theory · Mathematics 2025-03-19 Joshua Harrington , Lenny Jones

Let $q$ be an odd prime power and $\mathbb{F}_q$ be the finite field of $q$ elements. We define the Rudin-Shapiro function $R$ on monic polynomials $f=t^n+f_{n-1}t^{n-1}+\dots + f_0\in\mathbb{F}_q[t]$ over $\mathbb{F}_q$ by $$…

Number Theory · Mathematics 2025-08-14 László Mérai

Let $K$ be the function field of a smooth, irreducible curve defined over $\overline{\mathbb{Q}}$. Let $f\in K[x]$ be of the form $f(x)=x^q+c$ where $q = p^{r}, r \ge 1,$ is a power of the prime number $p$, and let $\beta\in \overline{K}$.…

Number Theory · Mathematics 2021-08-12 Andrew Bridy , John R. Doyle , Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

We show that a dynamical sequence $(f_n)_{n\in \mathbb{N}}$ of polynomials over a number field whose set of stable primes is of positive density must necessarily have a very restricted, and in particular ``near-solvable" dynamical Galois…

Number Theory · Mathematics 2024-10-29 Joachim König

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

Number Theory · Mathematics 2018-03-13 Joel Specter

We study the algebraic properties of Generalized Laguerre Polynomials for negative integral values of the parameter. For integers $r,n\geq 0$, we conjecture that $L_n^{(-1-n-r)}(x) = \sum_{j=0}^n \binom{n-j+r}{n-j}x^j/j!$ is a…

Number Theory · Mathematics 2007-05-23 Farshid Hajir

We consider the distribution of the Galois groups $\operatorname{Gal}(K^{\operatorname{un}}/K)$ of maximal unramified extensions as $K$ ranges over $\Gamma$-extensions of $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We prove two properties of…

Number Theory · Mathematics 2022-07-22 Yuan Liu , Melanie Matchett Wood , David Zureick-Brown

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

Let $n\ge 1$ be an integer and $e_n(x)$ denote the truncated exponential Taylor polynomial, i.e. $e_{n}(x)=\sum_{i=0}^n\frac{x^i}{i!}$. A well-known theorem of Schur states that the Galois group of $e_n(x)$ over $\Q$ is the alternating…

Number Theory · Mathematics 2020-11-13 Lingfeng Ao , Shaofang Hong

Let $K$ be a number field with ring of integers $\mathcal O_K$, and let $\{f_k\}_{k\in \mathbb N}\subseteq \mathcal O_K[x]$ be a sequence of monic polynomials such that for every $n\in \mathbb N$, the composition $f^{(n)}=f_1\circ…

Number Theory · Mathematics 2017-04-10 Andrea Ferraguti

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

Symbolic Computation · Computer Science 2020-05-06 Tao Zheng

Let $n$ be a positive integer and let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $q$ is a power of a prime. This paper introduces a natural action of the Projective Semilinear Group $\text{P}\Gamma \text{L}(2,…

Number Theory · Mathematics 2018-12-24 F. E. Brochero Martínez , Daniela Oliveira , Lucas Reis