Related papers: Squarefree values of trinomial discriminants

We determine all integers $n$ such that $n^2$ has at most three base-$q$ digits for $q \in \{2, 3, 4, 5, 8, 16 \}$. More generally, we show that all solutions to equations of the shape $$ Y^2 = t^2 + M \cdot q^m + N \cdot q^n, $$ where $q$…

The continue fractions of quadratic surds are periodic, according to a theorem by Lagrange. Their periods may have differing types of symmetries. This work relates these types of symmetries to the symmetries of the classes of the…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Swan (Pacific J. Math. 12(3) (1962), 1099-1106) characterized the parity of the number of irreducible factors of trinomials over $F_2$. Many researchers have recently obtained Swan-like results on determining the reducibility of polynomials…

Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)\cdots f(m)$. We prove that if $m > \max\{10^{12},4^{n+1}\}$, then there exists a prime divisor…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other's. Remarkably, these polynomials of dissimilar size have…

The purpose of this note is to suggest an analogue for genus 2 curves of part of Gross and Zagier's work on elliptic curves. Experimentally, for genus 2 curves with CM by a quartic CM field K, it appears that primes dividing the…

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

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…

We show that if a positive integer $q$ has $s(q)$ odd prime divisors $p$ for which $p^2$ divides $q$, then a positive proportion of the Laplacian eigenvalues of Maass newforms of weight $0$, level $q$, and principal character occur with…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots)…