Related papers: Global numerical bounds for the number-theoretic o…

Parameter estimation in ordinary differential equations, although applied and refined in various fields of the quantitative sciences, is still confronted with a variety of difficulties. One major challenge is finding the global optimum of a…

We show in this note that the average number of terms in the optimal double-base number system is in Omega(n / log n). The lower bound matches the upper bound shown earlier by Dimitrov, Imbert, and Mishra (Math. of Comp. 2008).

For $k\geq 1$ an integer and $x\geq 1$ a real number, let $\pi_k(x)$ be the number of integers smaller than $x$ having exactly $k$ distinct prime divisors. Building on recent work of Matom\"aki and Radziwi\l\l, we investigate the asymptotic…

Let $k\geq 1$ be an integer. Let $\delta_k(n)$ denote the maximum divisor of $n$ which is co-prime to $k$. We study the error term of the general $m$-th Riesz mean of the arithmetical function $\delta_k(n)$ for any positive integer $m \ge…

Assuming the Generalized Riemann Hypothesis, we provide uniform upper bounds with explicit main terms for moduli of $\left(\cL'/\cL\right)(s)$ and $\log{\cL(s)}$ for $1/2+\delta\leq\sigma<1$, fixed $\delta\in(0,1/2)$ and for functions in…

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

We consider the problem of $\Omega$ bounds for the partial sums of a modified character, \textit{i.e.}, a completely multiplicative function $f$ such that $f(p)=\chi(p)$ for all but a finite number of primes $p$, where $\chi$ is a primitive…

Given $n$ real numbers $0\leq x_1,...,x_n<1$ and a permutation~$\sigma$ of $\{1,...,n\}$, we can always find $\xbar_1,...,\xbar_n\in\{0,1\}$ so that the partial sums $\xbar_1+... +\xbar_k$ and $\xbar_{\sigma 1}+... +\xbar_{\sigma k}$ differ…

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

Let $f$ be analytic in the unit disk and $\mathcal{S}$ be the subclass of normalized univalent functions with $f(0) = 0$, and $f'(0) = 1$. Let $F$ be the inverse function of $f$, given by $F(w)=w+\sum_{n=2}^{\infty}A_nw^n$ defined on some…

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…

Let $N_n(X)$ denote the number of degree $n$ number fields with discriminant bounded by $X$. In this note, we improve the best known upper bounds on $N_n(X)$, finding that $N_n(X) = O(X^{ c (\log n)^2})$ for an explicit constant $c$.

For a fixed integer $k$, we define the multiplicative function \[D_{k,\omega}(n) := \frac{d(n)}{k^{\omega(n)}}, \]where $d(n)$ is the divisor function and $\omega (n)$ is the number of distinct prime divisors of $n$. The main purpose of…

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…

Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…

We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…

We introduce Omega functions that generalize Euler Gamma functions and study the functional difference equation they satisfy. Under a natural exponential growth condition, the vector space of meromorphic solutions of the functional equation…

First order methods endowed with global convergence guarantees operate using global lower bounds on the objective. The tightening of the bounds has been shown to increase both the theoretical guarantees and the practical performance. In…

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…