English
Related papers

Related papers: Explicit Hilbert Irreducibility

200 papers

The aim of this article is to provide a method to prove the irreducibility of non-linear ordinary differential equations by means of the differential Galois group of their variational equations along algebraic solutions. We show that if the…

Classical Analysis and ODEs · Mathematics 2018-12-26 Guy Casale , Jacques-Arthur Weil

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

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Number Theory · Mathematics 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan

We define polynomial H-identities for comodule algebras over a Hopf algebra H and establish general properties for the corresponding T-ideals. In the case H is a Taft algebra or the Hopf algebra E(n), we exhibit a finite set of polynomial…

Rings and Algebras · Mathematics 2014-03-14 Christian Kassel

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

Number Theory · Mathematics 2018-03-30 William Sawin , Mark Shusterman , Michael Stoll

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

How often is a quintic polynomial solvable by radicals? We establish that the number of such polynomials, monic and irreducible with integer coefficients in $[-H,H]$, is $O(H^{3.91})$. More generally, we show that if $n \ge 3$ and $n \notin…

Number Theory · Mathematics 2023-02-01 Sam Chow , Rainer Dietmann

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

Number Theory · Mathematics 2023-02-21 Sandro Mattarei , Marco Pizzato

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our first result, we show that if P is a n-dimensional Keller map,…

Algebraic Geometry · Mathematics 2007-05-23 Richard J. Lipton , Evangelos Markakis

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Number Theory · Mathematics 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

Number Theory · Mathematics 2024-01-23 Yury Kochetkov

We prove a version of Hilbert's Irreducibility Theorem in the quadratic case, giving a quantitative improvement to a result of Bilu-Gillibert in this restricted setting. As an application, we give improvements to several quantitative…

Number Theory · Mathematics 2021-12-01 Kaivalya Kulkarni , Aaron Levin

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

Logic · Mathematics 2025-05-13 Sohail Farhangi , Steve Jackson , Bill Mance

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

Let $X$ be a smooth, separated, geometrically connected scheme defined over a number field $K$ and $\{\rho_\lambda\}_\lambda$ a system of n-dimensional semisimple $\lambda$-adic representations of the \'etale fundamental group of $X$ such…

Number Theory · Mathematics 2023-08-04 Chun Yin Hui

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

Number Theory · Mathematics 2025-12-04 Anders Mah
‹ Prev 1 3 4 5 6 7 10 Next ›