English
Related papers

Related papers: Explicit Hilbert Irreducibility

200 papers

Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…

History and Overview · Mathematics 2015-11-16 Danil Akhtyamov , Ilya Bogdanov

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Number Theory · Mathematics 2021-09-27 Karl Dilcher , Maciej Ulas

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

Number Theory · Mathematics 2010-11-23 Liping Wang , Qiang Wang

In this paper, we give an explicit computable algorithm for the Zelevinsky-Aubert dual of irreducible representations of $p$-adic symplectic and odd special orthogonal groups. To do this, we establish explicit formulas for certain…

Representation Theory · Mathematics 2020-09-07 Hiraku Atobe , Alberto Minguez

Let $L/K$ be a Galois extension of number fields. We prove two lower bounds on the maximum of the degrees of the irreducible complex representations of ${\rm Gal}(L/K)$, the sharper of which is conditional on the Artin Conjecture and the…

Number Theory · Mathematics 2016-01-20 Jeremy Rouse , Frank Thorne

We review, under a perspective which appears different from previous ones, the so-called Hilbert Property (HP) for an algebraic variety (over a number field); this is linked to Hilbert's Irreducibility Theorem and has important…

Number Theory · Mathematics 2016-02-03 Pietro Corvaja , Umberto Zannier

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Number Theory · Mathematics 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…

Number Theory · Mathematics 2017-11-15 Joachim Koenig , Daniel Rabayev , Jack Sonn

We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…

Commutative Algebra · Mathematics 2025-07-15 Sarah Nakato , Roswitha Rissner

A polynomial f(t) with rational coefficients is strongly irreducible if f(t^k) is irreducible for all positive integers k. Likewise, two polynomials f and g are strongly coprime if f(t^k) and g(t^l) are relatively prime for all positive…

Geometric Topology · Mathematics 2011-05-16 Evan M. Bullock , Christopher William Davis

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

Commutative Algebra · Mathematics 2018-01-18 Beata Hejmej

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…

Number Theory · Mathematics 2019-02-20 Claus Fieker , Jürgen Klüners

Let $G$ be a finite classical group of Lie type of rank $\ell$, defined over a field of characteristic $p>2$. In this work, we classify the irreducible representations of $G$ whose dimensions are bounded by a constant proportional to…

Representation Theory · Mathematics 2025-11-19 Luis Gutiérrez Frez , Adrian Zenteno

The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like…

Number Theory · Mathematics 2022-12-16 John Cullinan

Let $n>m>k$ be positive integers and let $a,b,c$ be nonzero rational numbers. We consider the reducibility of some special quadrinomials $x^n+ax^m+bx^k+c$ with $n=4$ and 5, which related to the study of rational points on certain elliptic…

Number Theory · Mathematics 2016-05-24 Yong Zhang , Huilin Zhu

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Busé , Carlos D'Andrea

Let $X$ be a smooth projective geometrically irreducible curve over a perfect field $k$ of positive characteristic $p$. Suppose $G$ is a finite group acting faithfully on $X$ such that $G$ has non-trivial cyclic Sylow $p$-subgroups. We show…

Algebraic Geometry · Mathematics 2020-08-28 Frauke M. Bleher , Ted Chinburg , Aristides Kontogeorgis

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Number Theory · Mathematics 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib