Let f(x) be a primitive irreducible polynomial with integer coefficients of degree greater than one. In 1964, Hooley showed that the sequence of normalized roots u/n, where f(u) = 0(n), ordered in the obvious way, is uniformly distributed modulo one. It is the goal of this paper to show that if f(x) and g(x) are a pair of primitive irreducible polynomials of degree greater than one, not necessarily distinct, then the sequence (u/n,v/n), with f(u) = 0(n) and g(v) = 0(n), ordered in the obvious way, is uniformly distributed modulo one in the unit torus.
The equidistribution of roots of quadratic congruences with prime moduli depends crucially upon effective bounds for a special Weyl linear form. Duke, Friedlander and Iwaniec discovered a strong estimate for this Weyl linear form when the quadratic polynomial has negative discriminant. Tóth established an analogous but weaker bound when the quadratic polynomial has positive discriminant. We obtain a stronger estimate for the Weyl linear form for quadratics of positive discriminants.
We use the arithmetic of ideals in orders to parameterize the roots $μ\pmod m$ of the polynomial congruence $F(μ) \equiv 0 \pmod m$, $F(X) \in \mathbb{Z}[X]$ monic, irreducible and degree $d$. Our parameterization generalizes Gauss's classic parameterization of the roots of quadratic congruences using binary quadratic forms, which had previously only been extended to the cubic polynomial $F(X) = X^3 - 2$. We show that only a special class of ideals are needed to parameterize the roots $μ\pmod m$, and that in the cubic setting, $d = 3$, general ideals correspond to pairs of roots $μ_1 \pmod{m_1…
Motivated by a desire to understand the distribution of roots of cubic congruences, we re-derive a parametrization of roots $ν\pmod m$ of $X^3 \equiv 2 \pmod m$ found by Hooley. Although this parametrization does not lead us here to anything towards proving equidistribution of the sequence $\fracν{m} \pmod 1$, we are able to prove spacing results, and then a large sieve type inequality, which we view as analogous to the large sieve inequality for roots of quadratic congruences found by Fouvry and Iwaniec in their proof that there are infinitely many primes of the form $n^2 + p^2$. The parametr…
A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its product is congruent to $μ(p-1)$ modulo $p$, where $μ$ is the Möbius function. In this paper, we will generalize these two interesting congruences and give the congruences of the sum and the product of integers with the same index modulo $n$.
The distribution of intersections in $\mathrm{SL}(3, \mathbb{Z}) \backslash \mathrm{SL}(3, \mathbb{R})$ and lattices related to roots of cubic congruences
This paper proves that the $\mathbb{U}$-operator attached to a cocharacter is a right root of the corresponding Hecke polynomial. This result is an important ingredient in the proof of (i) the horizontal norm relations in the context of Gross--Gan--Prasad cycles and of (ii) the generalization of Eichler--Shimura relations.
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of residue classes. Using it, we are able to give an elegant description of some results due to Carl Schick, others are reduced to well-known theorems from algebra and number theory. Many concepts from number theory such as quadratic residues and primitive roots are equally applicable. It brings noticeable advantages in studying powers of odd primes, and in partic…
There has been significant recent interest in the arithmetic properties of the coefficients of $F(1-q)$ and $\mathscr{F}_t(1-q)$ where $F(q)$ is the Kontsevich-Zagier strange series and $\mathscr{F}_t(q)$ is the strange series associated to a family of torus knots as studied by Bijaoui, Boden, Myers, Osburn, Rushworth, Tronsgard and Zhou. In this paper, we prove prime power congruences for two families of generalized Fishburn numbers, namely, for the coefficients of $(ζ_N - q)^s F((ζ_N - q)^r)$ and $(ζ_N - q)^s \mathscr{F}_t((ζ_N - q)^r)$, where $ζ_N$ is an $N$th root of unity and $r$, $s$ are…
Let $t\in\mathbb{N}_+$ be given. In this article we are interested in characterizing those $d\in\mathbb{N}_+$ such that the congruence $$\frac{1}{t}\sum_{s=0}^{t-1}{n+dζ_t^s\choose d-1}\equiv {n\choose d-1}\pmod{d}$$ is true for each $n\in\mathbb{Z}$. In particular, assuming that $d$ has a prime divisor greater than $t$, we show that the above congruence holds for each $n\in\mathbb{Z}$ if and only if $d=p^r$, where $p$ is a prime number greater than $t$ and $r\in\{1,\ldots ,t\}$.
We give a short proof, using generating functions, for a polynomial congruence for Eulerian polynomials first proved, using arrangements of hyperplanes, by Yoshinaga and later proved, using roots of unity, by Iijima, Sasaki, Takahashi, and Yoshinaga.
We survey our joint work with Avner Ash and Mark McConnell that computationally investigates the cohomology of conguence subgroups of SL_4 (\Z). This is based on a talk given at the 2009 RIMS conference "Automorphic representations, automorphic L-functions and arithmetic."
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.
We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke, Friedlander and Iwaniec with averaging only over the modulus $q$ and of Dunn, Kerr, Shparlinski and Zaharescu with averaging only over $p$.
We prove a statement on p-adic continuity of matrices of coefficients of the logarithm of the Artin-Mazur formal group law associated to the middle cohomology of a hypersurface. As Jan Stienstra discovered in 1986, the entries of these matrices are coefficients of powers of the equation of the hypersurface, and in certain cases they satisfy congruences of Atkin and Swinnerton-Dyer type. These congruences imply that eigenvalues of our limiting matrices are eigenvalues of Frobenius of zero p-adic valuation on the middle crystalline cohomology of the fibre at p.
We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a calculation in p-adic cohomology made by Abbott, Kedlaya, and Roe, in which (using an implementation developed with Andre Wibisono) we recover the zeta function of a surface over a finite field.
We investigate spt-crank-type functions arising from Bailey pairs. We recall four spt-type functions corresponding to the Bailey pairs $A1$, $A3$, $A5$, and $A7$ of Slater and given four new spt-type functions corresponding to Bailey pairs $C1$, $C5$, $E2$, and $E4$. Each of these functions can be thought of as a count on the number of appearances of the smallest part in certain integer partitions. We prove simple Ramanujan type congruences for these functions that are explained by a spt-crank-type function. The spt-crank-type functions are two variable $q$-series determined by a Bailey pair, …
A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are bounded by $x$. In doing so, we extend two existing tools in ways that might be of independent interest. The Erd\H os-Turán inequality bounds the discrepancy between the number of elements of a sequence that lie in a particular interval modulo 1 and the expected number; we establish a version of this inequality where the interval is allowed to vary. We also…
We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions over the real numbers. We establish that our method has a higher order of convergence than J.F.T. Rabago's $p$-adic version of Olver's method from 2016. Moreover, we weaken the initial conditions in Rabago's method, which allows us to start the iteration with a multiple root of the congruence $f(x) \equiv 0 \bmod{p}$.
We continue to investigate spt-type functions that arise from Bailey pairs. In this third paper on the subject, we proceed to introduce additional spt-type functions. We prove simple Ramanujan type congruences for these functions which can be explained by a spt-crank-type function. The spt-crank-type functions are actually defined first, with the spt-type functions coming from setting $z=1$ in the spt-crank-type functions. We find some of the spt-crank-type functions to have interesting representations as single series, some of which reduce to infinite products. Additionally we find dissection…
Consider a strongly $b$-multiplicative sequence and a prime $p$. Studying its $p$-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of $p$. The integer values of the "norm" $3$-variate polynomial $\mathcal N_{p,i_1,i_2}(Y_0,Y_1,Y_2)\!:=\!\prod_{j=1}^{p-1}\left(Y_0{+}ζ_p^{i_1j}Y_1{+}ζ_p^{i_2j}Y_2\right),$ where $ζ_p$ is a primitive $p$-th root of unity, and $i_1,i_2{\in}\{1,2,\dots,p{-}1\},$ determine this asymptotic behaviour. It will be shown that a combinatorial method can be applied to $\mathcal N_{p,i_1,i_2}(Y_0,Y_1,Y_2)…
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density. We discuss two heuristic arguments to suggest a value for that density, one using recent advances made about the distribution of roots of polynomial congruences.
We establish a joint distribution result concerning the fractional part of $αp^θ$ for $θ\in (0,1), \ α>0$, where $p$ is a prime satisfying a Chebotarev condition in a fixed finite Galois extension over $\mathbb{Q}$. As an application, for a fixed non-CM elliptic curve $E/\mathbb{Q}$, an asymptotic formula is given for the number of primes at the extremes of the Sato-Tate measure modulo a large prime $\ell$. These are precisely the primes $p$ for which the Frobenius trace $a_p(E)$ satisfies the congruence $a_p(E)\equiv [2\sqrt{p}] \bmod \ell$. We assume a zero-free region hypothesis for Dedekin…
