Hostname: page-component-66d9dcfd78-njmxx Total loading time: 0 Render date: 2026-08-08T08:24:12.861Z Has data issue: false hasContentIssue false

Irreducibility of polynomials over global fields is diophantine

Published online by Cambridge University Press:  08 March 2018

Philip Dittmann*
Affiliation:
Mathematical Institute, University of Oxford, Woodstock Road, Oxford OX2 6GG, UK email dittmann@maths.ox.ac.uk

Abstract

Given a global field $K$ and a positive integer $n$ , we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have a root in $K$ . This strengthens a result by Colliot-Thélène and Van Geel [Compositio Math. 151 (2015), 1965–1980] stating that the set of non-$n$ th powers in a number field $K$ is diophantine. We also deduce a diophantine criterion for a polynomial over $K$ of given degree in a given number of variables to be irreducible. Our approach is based on a generalisation of the quaternion method used by Poonen and Koenigsmann for first-order definitions of $\mathbb{Z}$ in $\mathbb{Q}$ .

Information

Type
Research Article
Copyright
© The Author 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable