We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$. Thus we generalize a work of Browning, while we use a different sieveing technique for the middle range of primes.
It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to exhibit this property. In this article, we propose a method to show that ``cyclotomic polynomials $Φ_{\ell}(X)$ take square free values with positive proportion". Following this method, conditionally, we do prove the Square-free conjecture for all cyclotomic polynomials. The method is applicable to some other class of polynomials as well. Moreover we show t…
We investigate the density of square-free values of polynomials with large coefficients over the rational function field $\mathbb{F}_q[t]$. Some interesting questions answered as special cases of our results include the density of square-free polynomials in short intervals, and an asymptotic for the number of representations of a large polynomial $N$ as a sum of a small $k$-th power and a square-free polynomial.
Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has no irreducible factors of degree exceeding $\text{deg}~F -1$. We also give applications to generating sequences of irreducible polynomials.
We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as a subspace of the splitting field of another linearized polynomial.
In this paper we prove that polynomials $F(x_1, \cdots, x_n) \in \mathbb{Z}[x_1, \cdots, x_n]$ of degree $d \geq 3$, satisfying certain hypotheses, take on the expected density of $(d-1)$-free values. This extends the authors' earlier result where a different method implied the similar statement for polynomials of degree $d\geq 5$.
In this paper, we consider a variant of Turán's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$, there exist infinitely many square-free polynomials $g\in \mathbb{Z}[x]$ such that $L(f-g) \le 2$, where $L(f-g)$ denotes the sum of the absolute values of the coefficients of $f-g$. On the other hand, we show that this inequality cannot be replaced by $L(f-g) \le 1$. For this, for each integer $d \geq 16$ we construct infinitely many polynomials $f \in \mathbb{Z}…
A number of identities are proved by using Stirling transforms. These identities involve Stirling numbers of the first and second kinds, hyperharmonic and derangement numbers, Bernoulli and Euler numbers and polynomials, powers, power sums, and factorials.
For a real polynomial $f$ we present explicit zero-free angular sectors in the complex plane, symmetric with respect to the real axis, with angles depending only on the degree of $f$, and vertices expressed in terms of the coefficients of $f$. We also describe zero-free lens-shaped regions for $f$ that are associated to the zero-free sectors of the reciprocal of $f$. As an application, we use these zero-free regions to obtain irreducibility criteria for polynomials with integer coefficients that take a prime or a prime power value.
We study how well Fekete polynomials $$ F_p(X) = \sum_{n=0}^{p-1} \left(\frac{n}{p}\right) X^n \in {\mathbb Z}[X] $$ with the coefficients given by Legendre symbols modulo a prime $p$, can be approximated by power series representing algebraic functions of a given degree. We also obtain some explicit results describing polynomial recurrence relations which are satisfied by the coefficients of such algebraic functions.
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.
In this paper, a new $q$-supercongruence with two free parameters modulo the fourth power of a cyclotomic polynomial is obtained. Our main auxiliary tools are Watson's $_8ϕ_7$ transformation formula for basic hypergeometric series, the `creative microscoping' method recently introduced by Guo and Zudilin and the Chinese remainder theorem for coprime polynomials. By taking suitable parameter substitutions in the established $q$-supercongruence, some nice congruences involving the Bernoulli numbers are derived.
In this paper we consider the Daehee numbers and polynomials of the first and second kind, and give several explicit representations for them. In particular, we express the Daehee polynomials as the derivative of a generalized binomial coefficient. This is done by performing the Stirling transform of the power sum polynomial $S_k(x)$ associated with the sum of $k$th powers of the first $n$ positive integers $S_k(n) = 1^k + 2^k + \cdots + n^k$. Furthermore, we show the relationship between the Daehee polynomials and the hyperharmonic polynomials. This allows us to also express the hyperharmonic…
In this paper, we discuss sums of powers of the positive integers and compute both the exponential and ordinary generating functions for these sums. We express these generating functions in terms of exponential and geometric polynomials and also show their connection to other interesting series. In particular, we show their connection to an interesting problem of Ovidiu Furdui.
By means of the $q$-Zeilberger algorithm, we prove a basic hypergeometric supercongruence modulo the fifth power of the cyclotomic polynomial $Φ_n(q)$. This result appears to be quite unique, as in the existing literature so far no basic hypergeometric supercongruences modulo a power greater than the fourth of a cyclotomic polynomial have been proved. We also establish a couple of related results, including a parametric supercongruence.
Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$. We estimate the orders of these roots of unity in terms of the degrees and the heights of the polynomials $c_i$ and $f_i$.
Given a natural number $n \geq 2$, an integer $k$ and for a judiciously chosen $l = l(n)$ we give necessary and sufficient conditions for the polynomial $f_{n,k} = \big( \sum_{i=1}^{l} x_{i}^{n} \big) - k$ to have roots modulo every positive integer.
We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the $abc$-Conjecture for number fields, we obtain a finiteness result for powers in ratios of arbitrary elements in orbits.
Given a symmetric variety Y defined over the rationals and a non-zero polynomial with integer coefficients, we use techniques from homogeneous dynamics to establish conditions under which the polynomial can be made r-free for a Zariski dense set of integral points on Y. We also establish an asymptotic counting formula for this set. In the special case that Y is a quadric hypersurface, we give explicit bounds on the size of r by combining the argument with a uniform upper bound for the density of integral points on general affine quadrics.
By applying Chinese remainder theorem for coprime polynomials and the "creative microscoping" method recently introduced by the author and Zudilin, we establish parametric generalizations of three $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. The original $q$-supercongruences then follow from these parametric generalizations by taking the limits as the parameter tends to $1$ (l'Hôpital's rule is utilized here). In particular, we prove a complete $q$-analogue of the (J.2) supercongruence of Van Hamme and a complete $q$-analogue of a "divergent" Ramanujan-type supercon…
We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) = 0$ for all $n \geq 0$ then there exists infinitely many $m \in \mathbb{N}$, not divisible by $k$, such that $g(mk^n) = 0$ for some $n \geq 0$. As a consequence, we obtain a complete characterisation of sequences which are simultaneously automatic and generalised polynomial.