Ailon and Rudnick have shown that if $a,b \in C[T]$ are multiplicatively independent polynomials, then $°(\gcd(a^n-1,b^n-1))$ is bounded for all $n\ge1$. We show that if instead $a,b \in F[T]$ for a finite field $F$ of characteristic $p$, then $°(\gcd(a^n-1,b^n-1))$ is larger than $Cn$ for a constant $C=C(a,b)>0$ and for infinitely many $n$, even if $n$ is restricted in various reasonable ways (e.g., $gec(n,p)=1$).
We prove inequalities involving greatest common divisors of functions at integral points with respect to numerically parallel divisors, generalizing a result of Wang and Yasufuku (after work of Bugeaud-Corvaja-Zannier, Corvaja-Zannier, and the second author). After applying a result of Vojta on integral points on subvarieties of semiabelian varieties, we use geometry and the theory of heights to reduce to the (known) case of $\mathbb{G}_m^n$. In addition to proving results in a broader context than previously considered, we also study the exceptional set in this setting, for both the counting …
Let F/F_q be an algebraic function field of genus g defined over a finite field F_q. We obtain new results on the existence, the number and the density of dimension zero divisors of degree g-k in F where k is a positive integer. In particular, for q=2,3 we prove that there always exists a dimension zero divisor of degree γ-1 where γis the q-rank of F. We also give a necessary and sufficient condition for the existence of a dimension zero divisor of degree g-k for a hyperelliptic field F in terms of its Zeta function.
In this paper, we study properties of Weil height functions associated with numerically trivial divisors. It helps us to define the fractional limit of $h_E$ with respect to $h_D$ on $U$, with $D$ ample: \[ \Flim_D(E,U) := \liminf_{\substack{P \in U h_D(P) \rightarrow \infty}}\dfrac{h_E(P)}{h_D(P)}. \] The value of $\Flim_D(E,U)$ contains numerical information about a divisor $E$, enough to determine whether $E$ is ample, numerically effective or pseudo-effective.
A recursion for divisor function over divisors belonging to a prescribed finite sequence of positive integers and a solution of the Lahiri problem for divisor function $σ_x(n)$
对于有限的正整数序列$A=\{a_j\}_{j=1}^{k},$，我们证明了除数函数$σ_{x}^{(A)}(n)=\sum_{d|n,\enskip d\in A}d^x.$的一个递归式。作为推论，我们给出了D. B. Lahiri [3]：在$x=1.$的情况下，找到类似于经典五边形递归的除数函数$σ_x(n)$的恒等式
We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are fixed. Our results relate the parameter $A$ to the lengths of arithmetic progressions in which $d_k(n)$ is uniformly distributed. As applications to additive divisor sums, we establish new lower bounds and a new equivalent condition for the conjectured asymptotic. We also prove a Tauberian theorem for general additive divisor sums.
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and triangular numbers.
The class of Lambert series generating functions (LGFs) denoted by $L_α(q)$ formally enumerate the generalized sum-of-divisors functions, $σ_α(n) = \sum_{d|n} d^α$, for all integers $n \geq 1$ and fixed real-valued parameters $α\geq 0$. We prove new formulas expanding the higher-order derivatives of these LGFs. The results we obtain are combined to express new identities expanding the generalized sum-of-divisors functions. These new identities are expanded in the form of sums of polynomially scaled multiples of a related class of divisor sums depending on $n$ and $α$.
The purpose of this text is twofold. First we discuss some divisor problems involving Paul Erd\H os (1913-1996), whose centenary of birth is this year. In the second part some recent results on divisor problems are discussed, and their connection with the powers moments of $|ζ(\frac{1}{2}+it)|$ is pointed out. This is an extended version of the lecture given at the conference ERDOS100 in Budapest, July 1-5, 2013.
We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of MacMahon about their general form by relating them to quasi-modular forms. These functions arise as solutions to a curve-counting problem on Abelian surfaces.
We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.
In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordellés \cite{Bo} and Liu-Wu-Yang \cite{LWY}.
In 1919, P. A. MacMahon studied generating functions for generalized divisor sums. In this paper, we provide a framework in which to view these generating functions in terms of Jacobi forms, and prove that they are quasi-modular forms.
We improve using elementary means an explicit bound on the divisor function due to Friedlander and Iwaniec. Consequently we modestly improve a result regarding a sieving inequality for Gaussian sequences.
In this article, we study the Piltz divisor problem, which is sometimes called the generalized Dirichlet divisor problem, over number fields. We establish an identity akin to Voronoï's formula concerning the error term in the Dirichlet divisor problem.
We prove that $d_k(n)=d_k(n+B)$ infinitely often for any positive integers $k$ and $B$, where $d_k(n)$ denotes the number of divisors of $n$ coprime to $k$.
A representation of divisor function $τ(n)\equiv σ_{0}(n)$ by means of logarithmic residue of a function of complex variable is suggested. This representation may be useful theoretical instrument for further investigations of properties of natural numbers.
In a recent paper, Rose proves that certain generalized sum-of-divisor functions are quasi-modular forms for some congruence subgroup and conjectures that these forms are quasi-modular for $Γ_1(n)$. Here, we prove this conjecture.
For applications in algebraic geometric codes, an explicit description of bases of Riemann-Roch spaces of divisors on function fields over finite fields is needed. We give an algorithm to compute such bases for one point divisors, and Weierstrass semigroups over an optimal tower of function fields. We also explicitly compute Weierstrass semigroups till level eight.
Let $τ(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $τ(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.
An algorithm is presented to compute isolated values of the divisor summatory function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary and uses a geometric approach of successive approximation combined with coordinate transformation.
The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly position. From this representation an iterative equation for the function of the number of divisors was derivated. Also, the number of divisors of a integer can be found from a new function called the trace of the number n, trace(n). As a final preliminary result, using the Bressoud-Subbarao theorem, we obtain a new iterative representation of the sum of divisor …
We investigate the distribution of the function $ω(n)$, the number of distinct prime divisors of $n$, in residue classes modulo $q$ for natural numbers $q$ greater than 2. In particular we ask `prime number races' style questions, as suggested by Coons and Dahmen in their paper `On the residue class distribution of the number of prime divisors of an integer'.
Given a polynomial $ϕ$ over a global function field $K$ and a wandering base point $b\in K$, we give a geometric condition on $ϕ$ ensuring the existence of primitive prime divisors for almost all points in the orbit $\mathcal{O}_ϕ(b):=\{ϕ^n(b)\}_{n\geq0}$
We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers involving radicals.
In this article, we prove an asymptotic formula for mean values of long Dirichlet polynomials with higher order shifted divisor functions, assuming a smoothed additive divisor conjecture for higher order shifted divisor functions. As a consequence of this work, we prove special cases of conjectures of Conrey-Keating on mean values of long Dirichlet polynomials with higher order shifted divisor functions as coefficients.
This article establishes a new upper bound on the function $σ^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.
We investigate the behavior of the divisor function in both short intervals and in arithmetic progressions. The latter problem was recently studied by É. Fouvry, S. Ganguly, E. Kowalski, and Ph. Michel. We prove a complementary result to their main theorem. We also show that in short intervals of certain lengths the divisor function has a Gaussian limiting distribution. The analogous problems for Hecke eigenvalues are also considered.
Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^mτ_k$, where $τ_k$ is a $k$-dimensional divisor function and $E^m$ stands for the $m$-fold iterate of $E$. We estimate the error terms of $\sum_{n\le x} E^mτ_k(n)$ for various combinations of $m$ and $k$. We also study properties of $E^mf$ for arbitrary $f$ and sufficiently large $m$. Our study provides a unified approach to functions with exponential divisors. We improve special cases of the Dir…
We study the average value of the divisor function $τ(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$. We show how to go past this barrier when $q=p^k$ for odd primes $p$ and any fixed integer $k\ge 7$.
By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided that $q$ has a certain factorisation.
N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can consider respective divisor function $τ^{(r)}$ and sum-of-divisors function $σ^{(r)}$. In the present paper we investigate the asymptotic behaviour of $\sum_{n\le x} τ^{(r)}(n)$ and $\sum_{n\le x} σ^{(r)}(n)$. We also provide conditional estimates under Riemann hypothesis.
We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a result for any $α$-fold divisor function, for any complex number $α\not\in \{1\}\cup-\mathbb{N}$, even when considering a sequence of parameters $α$ close in a proper way to $1$. Our work builds on that of Harper and Soundararajan, who handled the particular case of $k$-fold divisor functions $d_k(n)$, with $k\in\mathbb{N}_{\geq 2}$.
The upper bound and the lower bound of average numbers of divisors of Euler Phi function and Carmichael Lambda function are obtained by Luca and Pomerance (see \cite{LP}). We improve the lower bound and provide a heuristic argument which suggests that the upper bound given by \cite{LP} is indeed close to the truth.
