English
Related papers

Related papers: Rational exponential sums over the divisor functio…

200 papers

Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…

Number Theory · Mathematics 2007-05-23 Hui June Zhu

A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…

Number Theory · Mathematics 2007-05-23 Simon Davis

We prove that the divisor function $d(n)$ counting the number of divisors of the integer $n$, is a good weighting function for the pointwise ergodic theorem. For any measurable dynamical system $(X, {\mathcal A},\nu,\tau)$ and any $f\in…

Dynamical Systems · Mathematics 2017-07-20 Christophe Cuny , Michel Weber

We obtain a nontrivial bound on the number of solutions to the equation $$ A^{x_1} + \ldots + A^{x_\nu} = A^{x_{\nu+1}} + \ldots + A^{x_{2\nu}}, \quad 1 \le x_1, \ldots,x_{2\nu} \le \tau, $$ with a fixed $n\times n$ matrix $A$ over a finite…

Number Theory · Mathematics 2021-10-22 Alina Ostafe , Igor E. Shparlinski , José Felipe Voloch

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution…

Number Theory · Mathematics 2014-07-08 J. LaChapelle

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…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

We give explicit bounds on sums of $d(n)^2$ and $d_4(n)$, where $d(n)$ is the number of divisors of $n$ and $d_4(n)$ is the number of ways of writing $n$ as a product of four numbers. In doing so we make a slight improvement on the upper…

Number Theory · Mathematics 2021-02-02 Michaela Cully-Hugill , Timothy Trudgian

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Number Theory · Mathematics 2017-09-01 Simon Macourt

We consider families of exponential sums indexed by a subgroup of invertible classes modulo some prime power $q$. For fixed $d$, we restrict to moduli $q$ so that there is a unique subgroup of invertible classes modulo $q$ of order $d$. We…

Number Theory · Mathematics 2021-12-13 Théo Untrau

Denote $f(n):=\sum_{1\le k\le n} \tau(2^k-1)$, where $\tau$ is the number of divisors function. Motivated by a question of Paul Erd\H{o}s, we show that the sequence of ratios $f(2n)/f(n)$ is unbounded. We also present conditional results on…

Number Theory · Mathematics 2026-02-04 Vjekoslav Kovač , Florian Luca

We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational…

Combinatorics · Mathematics 2014-01-14 Velleda Baldoni , Nicole Berline , Matthias Köppe , Michèle Vergne

According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…

Computational Complexity · Computer Science 2014-05-19 Pascal Koiran , Natacha Portier , Sébastien Tavenas

In this paper, we consider sums related the floor function. We can improve some previous results for some special arithmetic functions considered by Bordell\'es [3], Stucky[9] and Liu-Wu-Yang [6]. We can also give a refined result for…

Number Theory · Mathematics 2023-10-03 Wei Zhang

In the paper we prove a new upper bound for Heilbronn's exponential sum and obtain some applications of our result to distribution of Fermat quotients.

Number Theory · Mathematics 2012-08-31 Ilya D. Shkredov

Improving and extending recent results of the author, we conditionally estimate exponential sums with Dirichlet coefficients of L-functions, both over all integers and over all primes in an interval. In particular, we establish new…

Number Theory · Mathematics 2012-10-30 Stephan Baier

Let $\mathfrak{B}$ denote the collection of odd primitive Gaussian integers and $n\mapsto b(n)$ denote the characteristic function of elements of $\mathfrak{B}$. We prove that the exponential sum $ S(\alpha; N)=\sum_{n\le…

Number Theory · Mathematics 2026-04-13 E. Malavika , Olivier Ramaré

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…

Number Theory · Mathematics 2017-09-19 Yiqin He , Bicheng Zhang

Over the last 50 years a large number of effective exponential bounds on the first Chebyshev function $\vartheta(x)$ have been obtained. Specifically we shall be interested in effective exponential bounds of the form \[ |\vartheta(x)-x| < a…

Number Theory · Mathematics 2025-04-29 Matt Visser

We use the circle method to obtain tight bounds on the $L^p$ norm of an exponential sum involving the divisor function for $p > 2$.

Number Theory · Mathematics 2018-07-20 Mayank Pandey