To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
A prime $p$ is called a Wieferich prime if $2^{p-1}\equiv 1 \pmod {p^2}$. A monic polynomial $f(x)\in {\mathbb Z}\, [x]$ of degree $N\ge 2$ 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 $f(\theta )=0$. We show that ${\mathcal F}_p(x):=x^{2p}+2x^{p}+2$ is monogenic if and only if $p$ is not a Wieferich prime.
An abelian monogenic polynomial $f(x)\in {\mathbb Z}[x]$ is a monic polynomial of degree $N\ge 2$ that is irreducible over ${\mathbb Q}$, such that the Galois group of $f(x)$ over ${\mathbb Q}$ is abelian, and $\{1,\theta ,\theta ^2,\ldots ,\theta ^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta )$, where $f(\theta )=0$. We determine all abelian monogenic trinomials of the form $x^{2n}+ax^{n}+b$, where $n,a,b\in {\mathbb Z}$ with $n\ge 1$ and $ab\ne 0$.
Let $f(x)=x^{2p}+ax^p+b^p$, where p is a prime and $a,b\in {\mathbb Z}$ with $ab\ne 0$. If $f(x)$ is irreducible over ${\mathbb Q}$, we say that $f(x)$ is monogenic if $\{1,\theta ,\theta ^2,\ldots ,\theta ^{2p-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta )$, where $f(\theta )=0$. We give a characterisation of the monogenic trinomials $f(x)$ according to their Galois groups. These results extend prior investigations of the authors.
In this paper, we show that for each sufficiently large integer $H$, there is a real cubic number $\alpha$ and a rational number $r$, both of height smaller than $H$, such that $0\lt \alpha -r\lt 272/H^4$. The exponent $4$ of $H$ in this inequality is best possible. The numbers $\alpha$ and $r$ are both constructed explicitly. We also show that a necessary and sufficient condition on $(u,v)$ under which there is a positive constant $c_1=c_1(d,u,v)$ such that the inequality $|\alpha -\beta | \geq c_1 H(\alpha )^{-u} H(\beta )^{-v}$ holds for all real algebraic numbers $\alpha$ of degree $d \geq 2$ and all real algebraic numbers $\beta$ of degree $d-1$ is $u \geq d-1$ and $v \geq d$.
Let $f(x) = (x^{2}+1)^{n} - ax^{n} \in \mathbb {Z}[x]$ and assume $f(x)$ is irreducible. Let $\theta $ be a root of $f(x)$, set $K= \mathbb {Q}(\theta )$ and denote by $\mathbb {Z}_{K}$ the ring of integers of K. The index of f, denoted $\operatorname {ind}(f)$, is the index of $\mathbb {Z}[\theta ]$ in $\mathbb {Z}_{K}$. A polynomial $f(x)$ is said to be monogenic if $\operatorname {ind}(f) = 1$. We compute the discriminant of the polynomial $f(x)$, and then derive necessary and sufficient conditions on the parameters a and n for $f(x)$ to be monogenic. Furthermore, we provide a complete description of the primes that divide $\operatorname {ind}(f)$.
Given a nonzero integer n, Gupta and Saha [‘Integer solutions of the generalised polynomial Pell equations and their finiteness: the quadratic case’, Canad. Math. Bull., to appear] classified all polynomials $x^2+ax+b\in {\mathbb {Z}}[x]$ for which the polynomial Pell equation $P^2-(x^2+ax+b)Q^2=n$ has solutions ${P,Q\in {\mathbb {Z}}[x]}$ with $Q\neq 0$. We generalise their work to the equation $P^2-(f^2+af+b)Q^2=nR$, where f is a fixed polynomial in ${\mathbb {Z}}[x]$. As an application of our results, we study the equation $P^2-D(f)Q^2=n$, where D is a monic, quartic and non square-free polynomial in ${\mathbb {Z}}[x]$. This extends Theorem 1.4 of Scherr and Thompson [‘Quartic integral polynomial Pell equations’, J. Number Theory259 (2024), 38–56].
We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree d, over any global field. In particular, we focus on the affine hypersurface situation by relaxing the condition on the top degree homogeneous part of the polynomial describing the affine hypersurface, while sharpening the dependence on the degree in the bounds compared to previous results. We formulate a conjecture about plane curves which provides a conjectural approach to the uniform degree $3$ case (the only remaining open case). For induction on dimension, we develop a higher-dimensional effective version of Hilbert’s irreducibility theorem, which is of independent interest.
Determining the polynomials $D \in {\mathbb Z}[x]$ such that the polynomial Pell equation ${P^2-DQ^2=1}$ has nontrivial solutions $P,Q$ in ${\mathbb Q}[x]$ (and in ${\mathbb Z}[x]$) is an open question. In this article, we consider the generalized polynomial Pell equation $P^2-DQ^2=n$, where $D \in {\mathbb Z}[x]$ is a monic quadratic polynomial and n is a nonzero integer. For $n=1$, such an equation always has nontrivial solutions in ${\mathbb Q}[x]$, but for a non-square integer n, the generalized polynomial Pell equation $P^2-DQ^2=n$ may not always have a solution in ${\mathbb Q}[x]$. Depending on n, we determine the polynomials $D=x^2+cx+d$, for which the equation $P^2-DQ^2=n$ has nontrivial solutions in ${\mathbb Q}[x]$ and in ${\mathbb Z}[x]$. Taking $n=-1$, this allows us to solve the negative polynomial Pell equation completely for any such D. An interesting feature is that there are certain polynomials D for which the generalized polynomial Pell equation has nontrivial solutions in ${\mathbb Z}[x]$, but only finitely many, whereas the solutions in ${\mathbb Q}[x]$ are infinitely many. Finally, we determine the monic quadratic polynomials D for which the solutions of $P^2-DQ^2=n$ in ${\mathbb Z}[x]$ exhibit this finiteness phenomenon.
We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out maximal orders in number fields. The latter proves, in particular, an ‘arithmetic Bertini theorem’ conjectured by Poonen for ${\mathbb {P}}^1_{\mathbb {Z}}$.
Our methods also allow us to prove that there are $\gg X^{1/2+1/(n-1)}$ number fields of degree n having associated Galois group $S_n$ and absolute discriminant less than X, improving the best previously known lower bound of $\gg X^{1/2+1/n}$.
Finally, our methods correct an error in and thus resurrect earlier (retracted) results of Nakagawa on lower bounds for the number of totally unramified $A_n$-extensions of quadratic number fields of bounded discriminant.
Let (K, v) be a valued field and $\phi\in K[x]$ be any key polynomial for a residue-transcendental extension w of v to K(x). In this article, using the ϕ-Newton polygon of a polynomial $f\in K[x]$ (with respect to w), we give a lower bound for the degree of an irreducible factor of f. This generalizes the result given in Jakhar and Srinivas (On the irreducible factors of a polynomial II, J. Algebra556 (2020), 649–655).
Let $K={\mathbb {Q}}(\theta )$ be an algebraic number field with $\theta $ satisfying a monic irreducible polynomial $f(x)$ of degree n over ${\mathbb {Q}}.$ The polynomial $f(x)$ is said to be monogenic if $\{1,\theta ,\ldots ,\theta ^{n-1}\}$ is an integral basis of K. Deciding whether or not a monic irreducible polynomial is monogenic is an important problem in algebraic number theory. In an attempt to answer this problem for a certain family of polynomials, Jones [‘A brief note on some infinite families of monogenic polynomials’, Bull. Aust. Math. Soc.100 (2019), 239–244] conjectured that if $n\ge 3$, $1\le m\le n-1$, $\gcd (n,mB)=1$ and A is a prime number, then the polynomial $x^n+A (Bx+1)^m\in {\mathbb {Z}}[x]$ is monogenic if and only if $n^n+(-1)^{n+m}B^n(n-m)^{n-m}m^mA$ is square-free. We prove that this conjecture is true.
We study the discriminants of the minimal polynomials $\mathcal {P}_n$ of the Ramanujan $t_n$ class invariants, which are defined for positive $n\equiv 11\pmod {24}$. We show that $\Delta (\mathcal {P}_n)$ divides $\Delta (H_n)$, where $H_n$ is the ring class polynomial, with quotient a perfect square and determine the sign of $\Delta (\mathcal {P}_n)$ based on the ideal class group structure of the order of discriminant $-n$. We also show that the discriminant of the number field generated by $j({(-1+\sqrt {-n})}/{2})$, where j is the j-invariant, divides $\Delta (\mathcal {P}_n)$. Moreover, using Ye’s computation of $\log|\Delta(H_n)|$ [‘Revisiting the Gross–Zagier discriminant formula’, Math. Nachr. 293 (2020), 1801–1826], we show that 3 never divides $\Delta(H_n)$, and thus $\Delta(\mathcal{P}_n)$, for all squarefree $n\equiv11\pmod{24}$.
We prove an improvement on Schmidt’s upper bound on the number of number fields of degree n and absolute discriminant less than X for $6\leq n\leq 94$. We carry this out by improving and applying a uniform bound on the number of monic integer polynomials, having bounded height and discriminant divisible by a large square, that we proved in a previous work [7].
Let F be a system of polynomial equations in one or more variables with integer coefficients. We show that there exists a univariate polynomial $D \in \mathbb {Z}[x]$ such that F is solvable modulo p if and only if the equation $D(x) \equiv 0 \pmod {p}$ has a solution.
We prove a new irreducibility result for polynomials over ${\mathbb Q}$ and we use it to construct new infinite families of reciprocal monogenic quintinomials in ${\mathbb Z}[x]$ of degree $2^n$.
We give effective finiteness results for the power values of polynomials with coefficients composed of a fixed finite set of primes; in particular, of Littlewood polynomials.
We prove Lawton's conjecture about the upper bound on themeasure of the set on the unit circle on which a complex polynomial with a bounded number of coefficients takes small values. Namely, we prove that Lawton's bound holds for polynomials that are not necessarily monic. We also provide an analogous bound for polynomials in several variables. Finally, we investigate the dependence of the bound on the multiplicity of zeros for polynomials in one variable.
In 2013, Weintraub gave a generalization of the classical Eisenstein irreducibility criterion in an attempt to correct a false claim made by Eisenstein. Using a different approach, we prove Weintraub's result with a weaker hypothesis in a more general setup that leads to an extension of the generalized Schönemann irreducibility criterion for polynomials with coefficients in arbitrary valued fields.
In this paper, we give a general explicit form of Cassels’ $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $\mathbb{Z}$, we give a general unconditional upper bound for the smallest prime number $p$ such that $f$ has a simple root modulo $p$.