English
Related papers

Related papers: Irreducibility of polynomials with a large gap

200 papers

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…

Number Theory · Mathematics 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…

Number Theory · Mathematics 2018-09-21 Lucas Reis , Qiang Wang

We prove an irreducibility criterion for polynomials of the form $h(x)=x^{2m} + bx^m + c_1 \in F[x]$ relating to the Dickson polynomials of the first kind $D_p$. In the case when $F = \mathbb{Q}$, $m$ is a prime $p>3$, and $c_1=c^p$, for…

Number Theory · Mathematics 2024-01-26 Akash Jim , Thomas Hagedorn

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

Number Theory · Mathematics 2024-07-08 Alexei Entin , Alexander Popov

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

General Mathematics · Mathematics 2015-04-03 N. A. Carella

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

Algebraic Geometry · Mathematics 2009-04-29 Abdallah Assi

For positive integers $n$, the truncated binomial expansions of $(1+x)^n$ which consist of all the terms of degree $\le r$ where $1 \le r \le n-2$ appear always to be irreducible. For fixed $r$ and $n$ sufficiently large, this is known to…

Number Theory · Mathematics 2018-03-08 Michael Filaseta , Richard Moy

We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.

Complex Variables · Mathematics 2016-05-19 Guillaume Rond , Bernd Schober

The class B of lacunary polynomials f(x) := -1 + x + x^n + x^{m_1} + x^{m_2} + ... + x^{m_s}, where s >= 0, m_1 - n >= n - 1, m_{q+1} - m_{q} >= n - 1 for 1 <= q < s, n >= 3 is studied. A polynomial having its coefficients in {0, 1} except…

Number Theory · Mathematics 2020-02-20 Denys Dutykh , Jean-Louis Verger-Gaugry

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Number Theory · Mathematics 2015-09-08 Michiel Kosters

In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…

Number Theory · Mathematics 2025-07-16 Pierre-Alexandre Bazin

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

Probability · Mathematics 2022-09-07 Jimmy He , Huy Tuan Pham , Max Wenqiang Xu

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every $k$, the irreducible polynomials in $\mathbf{F}_q[t]$ contain configurations of the…

Number Theory · Mathematics 2009-09-02 Thai Hoang Le

We examine the question of when a quadratic polynomial f(x) defined over a number field K can have a newly reducible nth iterate, that is, f^n(x) irreducible over K but f^{n+1}(x) reducible over K, where f^n denotes the nth iterate of f.…

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

Number Theory · Mathematics 2021-07-21 Huy Tuan Pham , Max Wenqiang Xu

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

Number Theory · Mathematics 2025-03-19 Isaac Rajagopal

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
‹ Prev 1 8 9 10 Next ›