本文研究了所谓的“空多项式模m”，即，具有整数系数整系数多项式，对于任意整数x，满足f（x）=0（mod m）。对零多项式的研究有助于模m的高次同余的约化和模m的等价多项式函数的计数，即，在Z_m={0，.，m-1}由整数多项式生成。最著名的零多项式是f（x）=x^p-x modulo a prime p.在指出模复合的零多项式可以通过处理模每个素数幂的零多项式来研究之后，本文主要研究模p^d（d>=1）的零多项式.对于任何d>=1的值，给出一个典型的模p^d的最小次数的一元零多项式，从中可以进一步枚举所有模p^d的零多项式。本文得到的最有用的结果是定理32。4.4和它的衍生物-定理34节。4.5.结果在SEC。4.3形成一个基础上的归纳证明在第二节。4.4.但是，如果你不关心如何在SEC的证明。4.4你可以直接跳过Sec。4.3.定理28和31对于定理32的证明是非常重要的，应予以重视。注：完成本文后，我们注意到本文中的一些结果已被Kempner的文章[3，4]所覆盖。由于我们使用了不同的方法来获得结果，这项工作可以被认为是一个独立的和不同的证明。关于Kempner证明的简要介绍，请参见本文的附录。
英文摘要：
This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m and to enumerate equivalent polynomial functions modulo m, i.e., functions over Z_m={0, ..., m-1} generated by integer polynomials. The most well-known null polynomial is f(x)=x^p-x modulo a prime p.
After pointing out that null polynomials modulo a composite can be studied by handling null polynomials modulo each prime power, this paper mainly focuses on null polynomials modulo p^d (d>=1). A typical monic null polynomial of the least degree modulo p^d is given for any value of d>=1, from which one can further enumerate all null polynomials modulo p^d. The most useful result obtained in this paper are Theorem 32 in Sec. 4.4 and its derivative -- Theorem 34 in Sec. 4.5. The results given in Sec. 4.3 form a basis of the induction proofs given in Sec. 4.4. However, if you do not care how the proofs in Sec. 4.4 were established, you can simply skip Sec. 4.3. Theorems 28 and 31 are very important for the proof of Theorem 32 and should be paid more attention.
Note: After finishing this draft, we noticed that some results given in this paper have been covered in Kempner's papers [3,4]. Since we use a different way to obtain the results, this work can be considered as an independent and different proof. For a brief introduction to Kempner's proof, see the Appendix of this paper.
We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.
Two $q$-supercongruences of truncated basic hypergeometric series containing two free parameters are established by employing specific identities for basic hypergeometric series. The results partly extend two $q$-supercongruences that were earlier conjectured by the same authors and involve $q$-supercongruences modulo the square and the cube of a cyclotomic polynomial. One of the newly proved $q$-supercongruences is even conjectured to hold modulo the fourth power of a cyclotomic polynomial.
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
For a polynomial $f(x)\in\mathbb Z[x]$ without non-trivial linear relations among roots, we propose a conjecture on the distribution of the least root $r_p$ ($r_p\in\mathbb Z,\,0\le r_p<p)$ of $f(x)\equiv0\bmod p$ where $p$ runs over the set of primes such that $f(x)$ modulo $p$ is fully splitting.
We study the uniform distribution of the polynomial sequence $λ(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $λ(P)$ is uniformly distributed in $\mathbb{Z}$ if and only if $P(x)$ has at least one irrational coefficient other than the constant term. In the case of even degree, we prove a stronger result: $λ(P)$ intersects every congruence class modulo every integer if and only if $P(x)$ has at least one irrational coefficient other than the constant term.
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.
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.
We prove a two-parameter family of $q$-hypergeometric congruences modulo the fourth power of a cyclotomic polynomial. Crucial ingredients in our proof are George Andrews' multiseries extension of the Watson transformation, and a Karlsson--Minton type summation for very-well-poised basic hypergeometric series due to George Gasper. The new family of $q$-congruences is then used to prove two conjectures posed earlier by the authors.
In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of exponential automorphisms to positive characteristic. In this note we explore properties of the algorithm while using Segre homotopy and reductions modulo prime number. We give a method of retrieving an inverse of a given polynomial automorphism $F$ with integer coefficients form a finite set of the inverses of its reductions modulo prime numbers. Some examples illu…
Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le r_n<p$ and propose several conjectures on the distribution of an integer $\lceil \sum_{i\in S} r_i/p\rceil$ for a subset $S$ of $\{1,\dots,n\}$ when $p\to\infty$.
We study the algebraic dynamical systems generated by triangular systems of rational functions and estimate the height growth of iterations generated by such systems. Further, using a result on the reduction modulo primes of systems of multivariate polynomials over the integers, we study the periodic points and the intersection of orbits of such dynamical systems over finite fields. 1
Using Watson's terminating $_8ϕ_7$ transformation formula, we prove a family of $q$-congruences modulo the square of a cyclotomic polynomial, which were originally conjectured by the author and Zudilin [J. Math. Anal. Appl. 475 (2019), 1636--646]. As an application, we deduce two supercongruences modulo $p^4$ ($p$ is an odd prime) and their $q$-analogues. This also partially confirms a special case of Swisher's (H.3) conjecture.
For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set of primes $p$ such that all iterations of $f$ are irreducible modulo $p$ is of relative density zero. Furthermore, we give an explicit bound on the rate of the decay of the density of such primes in an interval $[1, Q]$ as $Q \to \infty$. For this class of polynomials this gives a more precise version of a recent result of A. Ferraguti (2018), which applies t…
A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial $f(x)\in\mathcal{O}_{K}[x]$ to be intersective. One of these criteria is in terms of the Galois group of the splitting field of the polynomial, whereas the second criterion is verifiable entirely in terms of constants which depend upon $K$ and the polynomial $f$. The proofs use the theory of global field extensions and upper bound on the least prime ideal in the Ch…
We prove congruence relations modulo cyclotomic polynomials for multisums of $q$-factorial ratios, therefore generalizing many well-known $p$-Lucas congruences. Such congruences connect various classical generating series to their $q$-analogs. Using this, we prove a propagation phenomenon: when these generating series are algebraically independent, this is also the case for their $q$-analogs.
Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{ν\geq 1} \left\{\frac{n}{p^ν}\right\} > 1 \quad \iff \quad p \mid \mathrm{denom}( B_n(x) - B_n ),$$ where $B_n(x) - B_n$ is the $n$th Bernoulli polynomial without constant term and $\mathrm{denom}(\cdot)$ is its denominator, which is squarefree.
For any positive integer $n$ and variables $a$ and $x$ we define the generalized Legendre polynomial $P_n(a,x)=\sum_{k=0}^n\b ak\b{-1-a}k(\frac{1-x}2)^k$. Let $p$ be an odd prime. In the paper we prove many congruences modulo $p^2$ related to $P_{p-1}(a,x)$. For example, we show that $P_{p-1}(a,x)\e (-1)^{<a>_p}P_{p-1}(a,-x)\mod {p^2}$, where $<a>_p$ is the least nonnegative residue of $a$ modulo $p$. We also generalize some congruences of Zhi-Wei Sun, and determine $\sum_{k=0}^{p-1}\binom{2k}k\binom{3k}k{54^{-k}}$ and $\sum_{k=0}^{p-1}\binom ak\binom{b-a}k\mod {p^2}$, where $[x]$ is the great…
We consider the {\it noisy polynomial interpolation problem\/} of recovering an unknown $s$-sparse polynomial $f(X)$ over the ring $\mathbb Z_{p^k}$ of residues modulo $p^k$, where $p$ is a small prime and $k$ is a large integer parameter, from approximate values of the residues of $f(t) \in \mathbb Z_{p^k}$. Similar results are known for residues modulo a large prime $p$, however the case of prime power modulus $p^k$, with small $p$ and large $k$, is new and requires different techniques. We give a deterministic polynomial time algorithm, which for almost given more than a half bits of $f(t)$…
Periods modulo $p$ of integer sequences associated with division polynomials of genus $2$ curves
Institute of Mathematics for Industry, Kyushu University（九州大学产业数学研究所）；Department of Mathematics, Faculty of Science, Kyoto University（京都大学理学部数学科）；Department of Mathematics, Cooperative Faculty of Education, Gunma University（群马大学教育学部协同数学科）；Department of Mathematics, Graduate School of Science, Kobe University（神户大学理学研究数理学科）；Department of Mathematical Sciences, Graduate School of Science, Tokyo Metropolitan University（东京都立大学理学研究科数学科学系）
In terms of the creative microscoping method recently introduced by Guo and Zudilin and the Chinese remainder theorem for coprime polynomials, we establish a $q$-supercongruence with two parameters modulo $[n]Φ_n(q)^3$. Here $[n]=(1-q^n)/(1-q)$ and $Φ_n(q)$ is the $n$-th cyclotomic polynomial in $q$. In particular, we confirm a recent conjecture of Guo and give a complete $q$-analogue of Long's supercongruence. The latter is also a generalization of a recent $q$-supercongruence obtained by Guo and Schlosser.
We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring of integers of $\mathbb{K}$. Our results provide an effective variant of a recent result of A.Bérczes, A.Ostafe, I.E.Shparlinski and J.H.Silverman (arXiv:1811.04971) on multiplicative dependence modulo a finitely generated subgroup by eliminating the use of non-effective results by K.F.Roth and G.Faltings.
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…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $α(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\ (mod\ n)$ is solvable. We describe a method that allows to determine the function $α$ associated to polynomials of the form $c_1x_1^k+c_2x_2^k+\cdots+c_tx_t^k$. Then we apply this method to polynomials that involve sums and differences of squares, mainly to the polynomials $x^2+y^2, x^2-y^2$ and $x^2+y^2+z^2$.
For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic fields of the form $\mathbb{Q}(\sqrt{F_P(n)})$ in short intervals $M\le n\le M+H$ previously due to Cilleruelo, Luca, Quirós and Shparlinski. As a second application, we estimate the average number of missing values of $F_P(n)(\text{mod}\ p)$ for special families of polynomials, generalizing previous work of Banks, Garaev, Luca, Schinzel, Shparlinski and oth…
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a q…
We present lower bounds for the orbit length of reduction modulo primes of parametric polynomial dynamical systems defined over the integers, under a suitable hypothesis on its set of preperiodic points over $\mathbb C$. Applying recent results of Baker and DeMarco~(2011) and of Ghioca, Krieger, Nguyen and Ye~(2017), we obtain explicit families of parametric polynomials and initial points such that the reductions modulo primes have long orbits, for all but a finite number of values of the parameters. This generalizes a previous lower bound due to Chang~(2015). As a by-product, we also slighly …
The scaled inverse of a nonzero element $a(x)\in \mathbb{Z}[x]/f(x)$, where $f(x)$ is an irreducible polynomial over $\mathbb{Z}$, is the element $b(x)\in \mathbb{Z}[x]/f(x)$ such that $a(x)b(x)=c \pmod{f(x)}$ for the smallest possible positive integer scale $c$. In this paper, we investigate the scaled inverse of $(x^i-x^j)$ modulo cyclotomic polynomial of the form $Φ_{p^s}(x)$ or $Φ_{p^s q^t}(x)$, where $p, q$ are primes with $p<q$ and $s, t$ are positive integers. Our main results are that the coefficient size of the scaled inverse of $(x^i-x^j)$ is bounded by $p-1$ with the scale $p$ modul…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the algebraic closure of the field with $p$ elements. We apply these bounds to study the periodic points and the intersection of orbits of algebraic dynamical systems over finite fields. In particular, we establish some links between these problems and the uniform dynamical Mordell-Lang conjecture.
The reduction modulo $p$ of a family of lacunary integer polynomials, associated with the dynamical zeta function $ζ_β(z)$ of the $β$-shift, for $β> 1$ close to one, is investigated. We briefly recall how this family is correlated to the problem of Lehmer. A variety of questions is raised about their numbers of zeroes in $\mathbb{F}_p$ and their factorizations, via Kronecker's Average Value Theorem (viewed as an analog of classical Theorems of Uniform Distribution Theory). These questions are partially answered using results of Schinzel, revisited by Sawin, Shusterman and Stoll, and density th…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound for the number of solutions modulo $p$, only differing from Lang-Weil by an asymptotic $p^ε$ multiplicative factor. Our second contribution is a reduction lemma to the case of a single equation which we use to extend our results to systems of equations. We show further how to use this reduction to prove the full Lang-Weil estimate for varieties, assuming it f…
Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In this paper, we use the principle of cross-classification to derive an explicit formula for the number ${\mathcal N}_{k,f,c}(n)$ of solutions $(x_1,...,x_k)$ of the congruence $x_1+...+x_k\equiv c\pmod n$ with all $x_i$ being $f$-exunits in the ring $\mathbb{Z}_n$. This extends a recent result of Anand {\it et al.} [On a question of $f$-exunits in $\mathbb{Z}…
This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $α\in (0,1/2)$. Suppose that $|X\pmod p|\leq (α+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the bound $|X|\ll_αN^α$ from Gallagher's larger sieve. On the other hand, we prove, assuming the truth of an inverse sieve conjecture, that the bound above can be improved (for example, to $|X|\ll_αN^{O(α^{2014})}$ for small $α$). The result follows from studying the average size of $|X\pmod p|$ as $p$ varies, when $X=f(\mathbb{Z})\cap [N]$ is the value set of a polynomial…
We study the qKZ difference equations with values in the $n$-th tensor power of the vector $sl_2$ representation $V$, variables $z_1,\dots,z_n$ and integer step $κ$. For any integer $N$ relatively prime to the step $κ$, we construct a family of polynomials $f_r(z)$ in variables $z_1,\dots,z_n$ with values in $V^{\otimes n}$ such that the coordinates of these polynomials with respect to the standard basis of $V^{\otimes n}$ are polynomials with integer coefficients. We show that the polynomials $f_r(z)$ satisfy the qKZ equations modulo $N$. Polynomials $f_r(z)$ are modulo $N$ analogs of the hyp…
Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form $$y\equiv f(x) \pmod{q},$$ with integer variables lying in some cube $\mathcal B$ of side length $H$. Our argument uses ideas of Cilleruelo, Garaev, Ostafe and Shparlinski which reduces the problem to the Vinogradov mean value theorem and a lattice point counting problem. We treat the lattice point problem differently using transference principles from the Geometr…
First, we present a new proof of Glaisher's formula dating from 1900 and concerning Wilson's theorem modulo p^2. Our proof uses p-adic numbers and Faulhaber's formula for the sums of powers (17th century), as well as more recent results on Faulhaber's coefficients obtained by Gessel and Viennot. Second, by using our method, we find a simpler proof than Sun's proof regarding a formula for (p-1)! modulo p^3, and one that can be generalized to higher powers of p. Third, we can derive from our method a way to compute the Stirling numbers modulo p^3, thus improving Glaisher and Sun's own results fr…
Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal theoretical setting, we prove the uniformity of the distribution of residues of an algebraic number modulo degree one ideals. Then using this result we show that the roots of a system of polynomial congruences are uniformly distributed. Finally, the distribution of digits of n-adic expansions of an algebraic number is discussed.
Let $f(x)$ be a nonconstant polynomial with integer coefficients and nonzero discriminant. We study the distribution modulo primes of the set of squarefree integers $d$ such that the curve $dy^2=f(x)$ has a nontrivial rational or integral point.
Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod p^2$ is irreducible, but $x^2+px \bmod p^2$ has exponentially many factors! We present the first randomized poly(deg $f, \log p$) time algorithm to factor a given univariate integral $f(x)$ modulo $p^k$, for a prime $p$ and $k \leq 4$. Thus, we solve the open question of factoring modulo $p^3$ posed in (Sircana, ISSAC'17). Our method reduces the general problem…
The Hilbert class polynomial $H_{\mathcal{O}}(x)\in \mathbb{Z}[x]$ attached to an order $\mathcal{O}$ in an imaginary quadratic field $K$ is the monic polynomial whose roots are precisely the distinct $j$-invariants of elliptic curves over $\mathbb{C}$ with complex multiplication by $\mathcal{O}$. Let $p$ be a prime inert in $K$ and strictly greater than $|\operatorname{disc}(\mathcal{O})|$. We show that the number of $\mathbb{F}_p$-roots of $H_\mathcal{O}(x)\!\! \pmod{p}$ is either zero or $|\operatorname{Pic}(\mathcal{O})[2]|$ by exhibiting a free and transitive action of $\operatorname{Pic}…
