English
Related papers

Related papers: Rational exponential sums over the divisor functio…

200 papers

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

Commutative Algebra · Mathematics 2023-10-17 Shalom Eliahou , Eshita Mazumdar

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…

Logic · Mathematics 2020-03-30 Ivan Georgiev , Lars Kristiansen , Frank Stephan

We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}\tau\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…

Number Theory · Mathematics 2017-04-24 Kostadinka Lapkova

We study an asymptotic behavior of the sum $\sum\limits_{n\le x}\frac{\D \tau(n)}{\D \tau(n+a)}$. Here $\tau(n)$ denotes the number of divisors of $n$ and $a\ge 1$ is a fixed integer.

Number Theory · Mathematics 2013-02-04 M. A. Korolev

We study a certain class of arithmetic functions that appeared in Klurman's classification of $\pm 1$ multiplicative functions with bounded partial sums, c.f., Comp. Math. 153 (8), 2017, pp. 1622-1657. These functions are periodic and…

Number Theory · Mathematics 2026-01-14 Marco Aymone , Gopal Maiti , Olivier Ramaré , Priyamvad Srivastav

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo…

Number Theory · Mathematics 2017-01-10 Olivier Bordellès

Paul Erdos and Carl Pomerance have proofs on an asymptotic upper bound on the number of preimages of Euler's totient function $\phi$ and the sum-of-divisors functions $\sigma$. In this paper, we will extend the upper bound to the number of…

Number Theory · Mathematics 2024-01-09 Agbolade Patrick Akande

Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the…

Combinatorics · Mathematics 2026-03-25 Jean-Christophe Pain

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

Number Theory · Mathematics 2019-05-09 Bryce Kerr , Igor E. Shparlinski , Kam Hung Yau

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

Number Theory · Mathematics 2023-03-03 Leonardo F. Bielinski , Giuliano G. La Guardia , Jocemar Q. Chagas

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

$T$-adic exponential sums associated to a Laurent polynomial $f$ are introduced. They interpolate all classical $p^m$-power order exponential sums associated to $f$. The Hodge bound for the Newton polygon of $L$-functions of $T$-adic…

Number Theory · Mathematics 2009-01-07 Chunlei Liu , Daqing Wan

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Number Theory · Mathematics 2007-05-23 Ernie Croot

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

Number Theory · Mathematics 2010-08-23 Glyn Harman , Angel Kumchev

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

Algebraic Geometry · Mathematics 2013-06-17 Claus Scheiderer

In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…

Number Theory · Mathematics 2025-02-06 K. Venkatasubbareddy , A. Sankaranarayanan

In this article we present certain formulas involving arithmetical functions. In the first part we study properties of sums and product formulas for general type of arithmetic functions. In the second part we apply these formulas to the…

General Mathematics · Mathematics 2018-08-21 Nikos Bagis

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

Number Theory · Mathematics 2019-06-03 Ali Mohammadi

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

Number Theory · Mathematics 2024-02-14 Sunil L Naik

The purpose of this article is to further explore how the structure of the affine group can be used to deduce new incidence theorems, and to explore sum-product type applications of these incidence bounds, building on the recent work of…

Combinatorics · Mathematics 2019-05-10 Oliver Roche-Newton , Audie Warren