相关论文: The average order of the M\"{o}bius function for B…

We establish a connection between analytic number theory and computational learning theory by showing that the M\"obius function belongs to a class of functions that is statistically hard to learn from random samples. Let $\mu_R$ denote the…

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations…

We consider the zeta and M\"obius functions of a partial order on integer compositions first studied by Bergeron, Bousquet-M\'elou, and Dulucq. The M\"obius function of this poset was determined by Sagan and Vatter. We prove rationality of…

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

Summation arithmetic functions of Mertens and Liouville are investigated in the paper. It is proved that the limiting distribution of these functions is the normal. It is also shown that the estimating of standard deviation of these…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

It is emphasized that the bunching parameter $\beta=P_B/P_D$ , i.e. the ratio between the probability to measure two bosons and two distinguishable particles at the same state, is a constant of motion and depends only on the overlap between…

Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n) z^n \equiv P(z) (mod 2), where p(A,n) is the number of…

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

We show how to compute the probability distributions of the order parameter of the $O(n)$ model at two-loop order of perturbation theory generalizing the methods developed for computing the same in case of the Ising model…

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $\zeta(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$…

Let $P^{\left(\frac 12\right)}(n)$ denote the middle prime factor of $n$ (taking into account multiplicity). More generally, one can consider, for any $\alpha \in (0,1)$, the $\alpha$-positioned prime factor of $n$, $P^{(\alpha)}(n)$. It…

In 2016 and 2017, Haihui Fan, Don Hadwin and Wenjing Liu proved a commutative and noncommutative version of Beurling's theorems for a continuous unitarily invariant norm $\alpha $ on $L^{\infty}(\mathbb{T},\mu)$ and tracial finite von…

If the prime numbers are pseudo-randomly distributed, then analogy with quantum systems suggests that counting primes might be modeled by a non-homogeneous Poisson process. Consequently, postulating underlying gamma statistics, more-or-less…

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

In this paper we obtain a mean value theorem for a general Dirichlet series $f(s)= \sum_{j=1}^\infty a_j n_j^{-s}$ with positive coefficients for which the counting function $A(x) = \sum_{n_{j}\le x}a_{j}$ satisfies $A(x)=\rho x +…

Let $\mu$ be the M\"{o}bius function and let $k \geq 1$. We prove that the Gowers $U^k$-norm of $\mu$ restricted to progressions $\{n \leq X: n\equiv a_q\pmod{q}\}$ is $o(1)$ on average over $q\leq X^{1/2-\sigma}$ for any $\sigma > 0$,…

A scarcely known generalization of Goldbach's conjecture introduced by Hardy and Littlewood states that for every pair of (relatively prime) positive integers m1 and m2, every sufficiently large integer n satisfying certain simple…

We present a new elementary algorithm that takes \[ \mathrm{time} \ \ O_\epsilon\left(x^{\frac{3}{5}} (\log x)^{\frac{3}{5}+\epsilon} \right) \ \ \mathrm{and}\ \ \mathrm{space} \ \ O\left(x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right)\]…