English
Related papers

Related papers: On asymptotic formulae in some sum-product questio…

200 papers

Let $p$ be an odd prime and $F_{\infty,\infty}$ a $p$-adic Lie extension of a number field $F$ with Galois group isomorphic to $\mathbb{Z}_p^r\rtimes\mathbb{Z}_p$, $r\geq 1$. Under certain assumptions, we prove an asymptotic formula for the…

Number Theory · Mathematics 2019-06-04 Dingli Liang , Meng Fai Lim

We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…

Number Theory · Mathematics 2015-03-12 Igor E. Shparlinski

The paper considers estimates for the asymptotics of summation functions of bounded multiplicative arithmetic functions. Several assertions on this subject are proved and examples are considered.

General Mathematics · Mathematics 2023-04-11 Victor Volfson

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

Number Theory · Mathematics 2022-01-21 Olivier Ramare , Alisa Sedunova , Ritika Sharma

We give lower bounds for the small moments of the sum of a random multiplicative function, which improve on some results of Bondarenko and Seip and constitute further progress towards (dis)proving a conjecture of Helson. We also prove…

Number Theory · Mathematics 2015-05-07 Adam J. Harper , Ashkan Nikeghbali , Maksym Radziwiłł

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

Number Theory · Mathematics 2008-01-21 Ahmet M. Guloglu , C. Wesley Nevans

Over the last several decades, improvements in the fields of analytic combinatorics and computer algebra have made determining the asymptotic behaviour of sequences satisfying linear recurrence relations with polynomial coefficients largely…

Symbolic Computation · Computer Science 2023-06-27 Ruiwen Dong , Stephen Melczer , Marc Mezzarobba

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

Number Theory · Mathematics 2024-11-12 Zarullo Rakhmonov , Firuz Rakhmonov

We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions d at least 4. This result depends on computations in the homology of the…

Combinatorics · Mathematics 2022-04-11 Yuliy Baryshnikov , Stephen Melczer , Robin Pemantle

We examine the sum of modified Bessel functions with argument depending quadratically on the summation index given by \[S_\nu(a)=\sum_{n\geq 1} (\frac{1}{2} an^2)^{-\nu} K_\nu(an^2)\qquad (|\arg\,a|<\pi/2)\] as the parameter $|a|\to 0$. It…

Classical Analysis and ODEs · Mathematics 2019-03-07 R. B. Paris

We prove asymptotic formulae for sums of the form $$ \sum_{n\in\mathbb{Z}^d\cap K}\prod_{i=1}^tF_i(\psi_i(n)), $$ where $K$ is a convex body, each $F_i$ is either the von Mangoldt function or the representation function of a quadratic form,…

Number Theory · Mathematics 2016-07-25 Pierre-Yves Bienvenu

Hyperasymptotics is an analytical method that incorporates exponentially small contributions into asymptotic approximations, thereby expanding their domain of validity, improving accuracy, and providing deeper insight into the underlying…

Classical Analysis and ODEs · Mathematics 2026-02-17 Gergő Nemes

We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…

Number Theory · Mathematics 2017-05-09 Dimitris Vartziotis , Aristos Tzavellas

We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by…

Number Theory · Mathematics 2021-04-08 Jiyou Li , Xiang Yu

This paper concerns the asymptotic behaviour of solutions of a linear convolution Volterra summation equation with an unbounded forcing term. In particular, we suppose the kernel is summable and ascribe growth bounds to the exogenous…

Dynamical Systems · Mathematics 2019-08-07 John A. D. Appleby , Denis D. Patterson

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng

Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…

Classical Analysis and ODEs · Mathematics 2021-03-02 T. M. Dunster

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

Number Theory · Mathematics 2024-04-02 Yasuhiro Ishitsuka , Takashi Taniguchi , Frank Thorne , Stanley Yao Xiao

We prove a range of new sum-product type growth estimates over a general field $\mathbb{F}$, in particular the special case $\mathbb{F}=\mathbb{F}_p$. They are unified by the theme of "breaking the $3/2$ threshold", epitomising the previous…

Combinatorics · Mathematics 2019-05-22 Brendan Murphy , Giorgis Petridis , Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov