Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
Kostadinka Lapkova
备注:
v1: Improves the result in arXiv:1509.08243, 11 pages; v2: Lemma 2 and Lemma 3 in stronger versions, thus improved results altogether. Lemma 3 gives an effective Polya-Vinogradov inequality implicit in a work of Frolenkov-Soundararajan v3: misprint corrected
Consider the divisor sum $\sum_{n\leq N}τ(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main term. As an application we give an improvement of the maximal possible number of $D(-1)$-quadruples.
We consider a binary quadratic variant of the Titchmarsh divisor problem and give an asymptotic formula for $\sum_{p^2+q^2\leq N} τ(p^2+q^2+1)$, where $p,q$ are primes.
In this paper, I use Siegel-Weil formula and Kudla matching principle to prove some interesting identities between representation number (of ternary quadratic space) and the degree of Heegner divisors.
We develop an elementary divisor theory for the unimodular and the modular group over quadratic field extensions and quaternion algebras. In particular, we investigate which sets of elementary divisors can occur. Under an additional hypothesis we establish a correspondence of unimodular and modular double cosets.
We generalize the concept of reduced Arakelov divisors and define $C$-reduced divisors for a given number $C \geq 1$. These $C$-reduced divisors have remarkable properties which are similar to the properties of reduced ones. In this paper, we describe an algorithm to test whether an Arakelov divisor of a real quadratic field $F$ is $C$-reduced in time polynomial in $\log|Δ_F|$ with $Δ_F$ the discriminant of $F$. Moreover, we give an example of a cubic field for which our algorithm does not work.
We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}τ\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a full square. We also provide effective upper bounds of the average divisor sum for some of the reducible quadratic polynomials considered before, with the same main term as in the asymptotic formula.
This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We extend the Selberg-Delange method to handle the following problems.\;The number of monic polynomials with degree $n$ have $t$ irreducible factors;\;The number of monic polynomials with degree $n$ in some residue classes have $t$ irreducible factors and the residue classes distribution of divisors of monic polynomial.\;
Consider the divisor sum $\sum_{n\leq N}τ(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve the maximal possible number of $D(-1)$-quadruples.
Let $k$ be a function field of one variable over a finite field with the characteristic not equal to two. In this paper, we consider the prehomogeneous representation of the space of binary quadratic forms over $k$. We have two main results. The first result is on the principal part of the global zeta function associated with the prehomogeneous vector space. The second result is on a mean value theorem for degree zero divisor class groups of quadratic extensions over $k$, which is a consequence of the first one.
We study the sum of divisors of the quadratic form $m_1^2+m_2^2+m_3^2$. Let $$S_3(X)=\sum_{1\le m_1,m_2,m_3\le X}τ(m_1^2+m_2^2+m_3^2).$$ We obtain the asymptotic formula $$S_3(X)=C_1X^3\log X+ C_2X^3+O(X^2\log^7 X),$$ where $C_1,C_2$ are two constants. This improves upon the error term $O_\varepsilon(X^{8/3+\varepsilon})$ obtained by Guo and Zhai.
In a recent paper, Lapkova uses a Tauberian theorem to derive the asymptotic formula for the divisor sum $\sum_{n \leq x} d( n (n+v))$ where $v$ is a fixed integer and $d(n)$ denotes the number of divisors of $n$. We reprove her result by following a suggestion of Hooley, namely investigating the relationship between this sum and the well-known sum $\sum_{n \leq x} d( n ) d (n+v)$. As such, we are able to furnish additional terms in the asymptotic formula.
Let $F({\bf x})={\bf x}^tQ_{\bf x}+\mathbf{b}^t{\bf x}+c\in\mathbb{Z}[{\bf x}]$ be a quadratic polynomial in $\ell (\ge 3 )$ variables ${\bf x} =(x_{1},...,x_{\ell})$, where $F({\bf x})$ is positive when ${\bf x}\in\mathbb{R}_{\ge 1}^{\ell}$, $Q\in {\rm M}_{\ell}(\mathbb{Z})$ is an $\ell\times\ell$ matrix and its discriminant $\det\left(Q^t+Q\right)\neq 0$. It gives an explicit asymptotic formula for the following sum \[\sum_{{\bf x}\in [1,X]^{\ell}\cap\mathbb{Z}^{\ell}}τ\left(F({\bf x})\right), \] where $τ$ is the divisor function.
Let $q > 2$ be a prime number and define $λ_q := \left( \fracτ{q} \right)$ where $τ(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $τ(n)$ is a quadratic residue modulo $q$, then $\left( λ_q \star \mathbf{1} \right) (n)$ could be close to the number of divisors of $n$. This is the aim of this work to compare the mean value of the function $λ_q \star \mathbf{1}$ to the well known average order of $τ$. The proof reveals that the results depend heavily on the value of $\left( \frac{2}{q} \right)$. A bound for short sums in the case $q=5$ is a…
Let $τ_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}τ_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log x)^2+ c_2x^{\frac{3}{2}}\log x +c_3x^{\frac{3}{2}} +O_{\varepsilon}(x^{\frac{11}{8}+\varepsilon}) $$ for some constants $c_1$, $c_2$ and $c_3$.
Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ Σ_{k,F}(X; {\mathcal{B}})=\sum_{{\bf x}\in X\mathcal{B}\cap\mathbb{Z}^{n}}τ_{k}\left(F({\bf x})\right), $$ for $X$ tending to infinity, where $\mathcal{B}\subset\mathbb{R}^n$ is an $n$-dimensional box such that $\min\limits_{{\bf x}\in X\mathcal{B}}F({\bf x})\ge 0$ for all sufficiently large $X$, and $τ_{k}(\cdot)$ is the $k$-th divisor function for any integer $k\ge 2$.
Let $\mathcal{A}$ and $\mathcal{B}$ be sets of polynomials of degree $n$ over a finite field. We show, that if $\mathcal{A}$ and $\mathcal{B}$ are large enough, then $A+B$ has an irreducible divisor of large degree for some $A\in\mathcal{A}$ and $B\in \mathcal{B}$.
Let $P(x)$ be an irreducible quadratic polynomial in $\mathbb{Z}[x]$. We show that for almost all $n$, $P(n)$ does not lie in the range of Euler's totient function.
Let $F({\bf x})={\bf x}^tQ_m{\bf x}+\mathbf{b}^t{\bf x}+c\in\mathbb{Z}[{\bf x}]$ be a quadratic polynomial in $\ell (\ge 3 )$ variables ${\bf x} =(x_{1},...,x_{\ell})$, where $F({\bf x})$ is positive when ${\bf x}\in\mathbb{R}_{\ge 1}^{\ell}$, $Q_m\in {\rm M}_{\ell}(\mathbb{Z})$ is an $\ell\times\ell$ matrix and its discriminant $\det\left(Q_m^t+Q_m\right)\neq 0$. It gives explicit asymptotic formulas for the following sum \[ T_{k,F}(X)=\sum_{{\bf x}\in [1,X]^{\ell}\cap\mathbb{Z}^{\ell}}τ_{k}\left(F({\bf x})\right) \] with the help of the circle method. Here $τ_{k}(n)=\#\{(x_1,x_2,...,x_{k})\i…
The function $h^0$ for a number field is an analogue of the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. In this paper, we prove the conjecture of van der Geer and Schoof about the maximality of $h^0$ at the trivial Arakelov divisor for quadratic extensions of complex quadratic fields.
We estimate asymptotically the fourth moment of the Riemann zeta-function twisted by a Dirichlet polynomial of length $T^{\frac14 - \varepsilon}$. Our work relies crucially on Watt's theorem on averages of Kloosterman fractions. In the context of the twisted fourth moment, Watt's result is an optimal replacement for Selberg's eigenvalue conjecture. Our work extends the previous result of Hughes and Young, where Dirichlet polynomials of length $T^{\frac{1}{11}-\varepsilon}$ were considered. Our result has several applications, among others to the proportion of critical zeros of the Riemann zeta…
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must have density zero, regardless of choice of a_0. The proof relies on tools from group theory and probability theory to develop a zero-density criterion in terms of arithmetic properties of the forward orbit of the critical point of f. This provides an analogy to results in real and complex dynamics, where analytic properties of the forward orbit of the critica…
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in $C$ is irreducible. As a second result, we give an algorithm to determine whether all the elements in $C$ are irreducible, using only $O( \#S (\log q)^3 q^{1/2} )$ operations.
A unitary divisor $c$ of a positive integer $n$ is a positive divisor of $n$ that is relatively prime to $\displaystyle{\frac{n}{c}}$. For any integer $k$, the function $σ_k^*$ is a multiplicative arithmetic function defined so that $σ_k^*(n)$ is the sum of the $k^{th}$ powers of the unitary divisors of $n$. We provide analogues of the functions $σ_k^*$ in imaginary quadratic rings that are unique factorization domains. We then explore properties of what we call $n$-powerfully unitarily $t$-perfect numbers, analogues of the unitary multiperfect numbers that have been defined and studied in the…
We study the primitive divisors of the terms of $(Δ_n)_{n \geq 1}$, where $Δ_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms of the sequence that do not have a primitive prime divisor.
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an irreducible polynomial of degree n and order 2^rt with t odd, the construction produces ord_t(2)/d irreducible polynomials of degree n and order t for a certain divisor d of n. The construction can be used, for example, to search irreducible polynomials with specific requirements on its coefficients.
In this rather computational paper, we determine certain representation numbers of ideals in real quadratic number fields explicitly in order to obtain a representation of the associated Dirichlet series in terms of Dirichlet L-functions and a generalized divisor sum. A direct and important consequence is that the Dirichlet series has a meromorphic continuation to the whole complex plane and a simple pole at $s=2$ whose residue can be made explicit in terms of the Dirichlet L-functions and the generalized divisor sum.
A. Mukhopadhyay, M. R. Murty and K. Srinivas (http://arxiv.org/abs/0808.0418) have recently studied various arithmetic properties of the discriminant $Δ_n(a,b)$ of the trinomial $f_{n,a,b}(t) = t^n + at + b$, where $n \ge 5$ is a fixed integer. In particular, it is shown that, under the $abc$-conjecture, for every $n \equiv 1 \pmod 4$, the quadratic fields $\Q(\sqrt{Δ_n(a,b)})$ are pairwise distinct for a positive proportion of such discriminants with integers $a$ and $b$ such that $f_{n,a,b}$ is irreducible over $\Q$ and $|Δ_n(a,b)|\le X$, as $X\to \infty$. We use the square-sieve and bounds …
The main goal of this paper is to provide a complete answer to the Problem 22 of Narkiewicz \cite{Nar} for any sextic number field $K$ generated by a complex root $α$ of a monic irreducible trinomial $F(x) = x^6+ax^5+b \in \mathbb{Z}[x]$. Namely we calculate the index of the field $K$. In particular, if $i(K)\neq 1$, then $K$ is not mongenic. Finally, we illustrate our results by some computational examples.
We obtain several asymptotic estimates for the sums of the restricted divisor function $$ τ_{M,N}(k) = #\{1 \le m \le M, \ 1\le n \le N: mn = k\} $$ over short arithmetic progressions, which improve some results of J. Truelsen. Such estimates are motivated by the links with the pair correlation problem for fractional parts of the quadratic function $αk^2$, $k=1,2,...$ with a real $α$.
Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular, given a divisor $D>2$ of $q+1$ and an irreducible polynomial $f\in \mathbb F_{q}[x]$ of degree $n$ such that $n$ is even or $D\not \equiv 2\pmod 4$, we show how to obtain from $f$ a sequence $\{f_i\}_{i\ge 0}$ of irreducible polynomials over $\mathbb F_q$ with $\mathrm{deg}(f_i)=n\cdot D^{i}$.
Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We determine the order of magnitude of $H_F(x, y, z)$ uniformly for $y+y/\log^C y < z\le y^2$ and $y\le x^{1-δ}$, showing that the order is the same as the order of $H(x,y,z)$, the number of positive integers $n\le x$ with a divisor in $(y,z]$. Here $C$ is an arbitrarily large constant and $δ>0$ is arbitrarily small.
Let $a(r,n)$ be $r$th coefficient of $n$th cyclotomic polynomial. Suzuki proved that $\{a(r,n)|r\geq 1,n\geq 1\}=\mathbb{Z}$. If $m$ and $n$ are two natural numbers we prove an analogue of Suzuki's theorem for divisors of $x^n-1$ with exactly $m$ irreducible factors. We prove that for every finite sequence of integers $n_1,\ldots,n_r$ there exists a divisor $f(x)=\sum_{i=0}^{deg(f)}c_ix^i$ of $x^n-1$ for some $n\in \mathbb{N}$ such that $c_i=n_i$ for $1\leq i \leq r$. Let $H(r,n)$ denote the maximum absolute value of $r$th coefficient of divisors of $x^n-1$. In the last section of the paper we…
Given a set $S=\{x^2+c_1,\dots,x^2+c_s\}$ defined over a field and an infinite sequence $γ$ of elements of $S$, one can associate an arboreal representation to $γ$, generalizing the case of iterating a single polynomial. We study the probability that a random sequence $γ$ produces a ``large-image'' representation, meaning that infinitely many subquotients in the natural filtration are maximal. We prove that this probability is positive for most sets $S$ defined over $\mathbb{Z}[t]$, and we conjecture a similar positive-probability result for suitable sets over $\mathbb{Q}$. As an application o…
In this paper we extend to the function field setting the heuristics formerly developed by Conrey, Farmer, Keating, Rubinstein and Snaith, for the integral moments of $L$-functions. We also adapt to the function setting the heuristics first developed by Conrey, Farmer and Zirnbauer to the study of mean values of ratios of $L$-functions. Specifically, the focus of this paper is on the family of quadratic Dirichlet $L$-functions $L(s,χ_{P})$ where the character $χ$ is defined by the Legendre symbol for polynomials in $\mathbb{F}_{q}[T]$ with $\mathbb{F}_{q}$ a finite field of odd cardinality and…
Let $f(x)=x^7+ax+b$ be an irreducible polynomial having integer coefficients and $K=\mathbb{Q}(θ)$ be an algebraic number field generated by a root $θ$ of $f(x)$. In the present paper, for every rational prime $p$, our objective is to determine the necessary and sufficient conditions involving only $a,~b$ so that $p$ is a divisor of the index of the field $K$. In particular, we provide sufficient conditions on $a$ and $b$, for which $K$ is non-monogenic. In a special case, we show that if either $8$ divides both $a\pm1$, $b$ or $32$ divides both $a+4$, $b$, then $K$ is non-monogenic. We illust…
In this paper, we deal with the problem of monogenity of number fields defined by monic irreducible trinomials $F(x)=x^{12}+ax^m+b\in \mathbb{Z}[x]$ with $1\leq m\leq11$. We give sufficient conditions on $a$, $b$, and $m$ so that the number field $K$ is not monogenic. In particular, for $m=1$ and for every rational prime $p$, we characterize when $p$ divides the index of $K$ and we provide a partial answer to the Problem $22$ of Narkiewicz \cite{Nar} for these number fields. Our results are illustrated by computational examples.
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…
Let $K=\Q(θ)$ be an algebraic number field with $θ$ a root of an irreducible quadrinomial $f(x) = x^6+ax^m+bx+c\in\Z[x] $ with $m\in\{2,3,4,5\}$. In the present paper, we give some explicit conditions involving only $a,~b,~c$ and $m$ for which $K$ is non-monogenic. In each case, we provide the highest power of a rational prime $p$ dividing index of the field $K$. In particular, we provide a partial answer to the Problem $22$ of Narkiewicz \cite{Nar} for these number fields. Finally, we illustrate our results through examples.
For a quadratic field K, we investigate continuous mod p representations of the absolute Galois groups of K that are unramified away from p and infinity. We prove that for certain pairs (K,p), there are no such irreducible representations. We also list some imaginary quadratic fields for which such irreducible representations exist. As an application, we look at elliptic curves with good reduction away from 2 over quadratic fields.
Let $k\geq 3$ and $n\geq 3$ be odd integers, and let $m\geq 0$ be any integer. For a prime number $\ell$, we prove that the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{\ell^{2m}-2k^n})$ is either divisible by $n$ or by a specific divisor of $n$. Applying this result, we construct an infinite family of certain tuples of imaginary quadratic fields of the form $$\left(\mathbb{Q}(\sqrt{d}), \mathbb{Q}(\sqrt{d+1}), \mathbb{Q}(\sqrt{4d+1}), \mathbb{Q}(\sqrt{2d+4}), \mathbb{Q}(\sqrt{2d+16}), \cdots, \mathbb{Q}(\sqrt{2d+4^t}) \right)$$ with $d\in \mathbb{Z}$ and $1\leq 4^t\leq 2|d|…
Let $ \mathbb{F}_q[T]$\, be the ring of polynomials over a finite field $ \mathbb{F}_q $. Let $ g: \mathbb{F}_q[T] \rightarrow \mathbb{R} $ be a multiplicative function such that for any irreducible polynomial $ P $ over $ \mathbb{F}_q $ and any $ k \ge 1 $, the equality $ d_k = g (P ^ k) $ holds for some arbitrary sequence of reals $\{d_k\}_{k=1}^{\infty}$. In this paper, we get an explicit formula for the sum $$ T (N) = \sum\limits_{\substack{°F=N F \text{ is monic}}}{g (F)}, $$ and also derive different asymptotics when this sum in cases of $ q \to \infty; \ q \to \infty, \ N \to \infty; \ …
It is well known that a triangle with side lengths 3, 4 and 5 is right-angled. Euclid was the first to give a formula for generating other right-angled triangles with integer side lengths. In this text, I present a novel algorithm to generate all possible right-angled triangles with integer side lengths, in which the three side lengths have no common divisor. The algorithm is based on the difference in length between the hypothenuse and the largest of the two other sides. I also prove the completeness of this algorithm: it generates all possible such triangles and nothing but such triangles.
We study the distribution of spacings between squares modulo q as the number of prime divisors of q tends to infinity. In an earlier paper Kurlberg and Rudnick proved that the spacing distribution for square free q is Poissonian, this paper extends the result to arbitrary q.
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 show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses the Weil bound from algebraic geometry.
Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.