Related papers: Dickman polylogarithms and their constants

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

Let $\gcd(j,k)$ be the greatest common divisor of the integers $j$ and $k$. In this paper, we give several interesting asymptotic formulas for weighted averages of the $\gcd$-sum function $f(\gcd(j,k)) $ and the function $\sum_{d|k,…

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…

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…

The class of Lambert series generating functions (LGFs) denoted by $L_{\alpha}(q)$ formally enumerate the generalized sum-of-divisors functions, $\sigma_{\alpha}(n) = \sum_{d|n} d^{\alpha}$, for all integers $n \geq 1$ and fixed real-valued…

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…

Given a constant $\alpha>0$, an $n$-vertex graph is called an $\alpha$-expander if every set $X$ of at most $n/2$ vertices in $G$ has an external neighborhood of size at least $\alpha|X|$. Addressing a question posed by Friedman and…

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

We show that if $F(s)$ is a nondegenerate ordinary Dirichlet series with nonnegative coefficients and $F(k)$ is a rational number for all large enough positive integers $k$, then the denominators of those rational numbers are unbounded. In…

In this paper, we study the zero sets of the confluent hypergeometric function $_{1}F_{1}(\alpha;\gamma;z):=\sum_{n=0}^{\infty}\frac{(\alpha)_{n}}{n!(\gamma)_{n}}z^{n}$, where $\alpha, \gamma, \gamma-\alpha\not\in \mathbb{Z}_{\leq 0}$, and…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

We study piecewise polynomial functions $\gamma_k(c)$ that appear in the asymptotics of averages of the divisor sum in short intervals. Specifically, we express these polynomials as the inverse Fourier transform of a Hankel determinant that…

Generating functions and functional equations of Dickson polynomials of the first and second kind are derived and continued analytically. These formulae are expressed in terms of the incomplete gamma function over complex variables of the…

We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

Let $f(z)=\sum_{n=1}^\infty a(n)q^n\in S^{\text{new}}_ k (\Gamma_0(N))$ be a newform with squarefree level $N$ that does not have complex multiplication. For a prime $p$, define $\theta_p\in[0,\pi]$ to be the angle for which $a(p)=2p^{( k…

It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…

For univalent and normalized functions $f$ the logarithmic coefficients $\gamma_n(f)$ are determined by the formula $\log(f(z)/z)=\sum_{n=1}^{\infty}2\gamma_n(f)z^n$. In the paper \cite{Pon} the authors posed the conjecture that a locally…

Let a_n(k) be the kth coefficient of the nth cyclotomic polynomial Phi_n(x). As n ranges over the integers, a_n(k) assumes only finitely many values. For any such value v we determine the density of integers n such that a_n(k)=v. Also we…