Related papers: The behaviour of a certain additive function in la…

We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length $k$ in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.

Behavior of systems that are functions of anticipated behavior of other systems, whose own behavior is also anticipatory but homeostatic and determined by hierarchical ordering, which changes over time, of sets of possible environments that…

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

We study whether several consecutive prime gaps can all be relatively large at the same time, or is it possible that all are squares or perfect powers, or perhaps none of them are squares? A few related results and problems are also…

Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.

We study the average value of the divisor function $\tau(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$.…

Self-powered motion in catalytic colloidal particles provides a compelling example of active matter, i.e. systems that engage in single-particle and collective behavior far from equilibrium. The long-time, long-distance behavior of such…

According to a general probabilistic principle, the natural divisors of friable integers (i.e.~free of large prime factors) should normally present a Gaussian distribution. We show that this indeed is the case with conditional density…

We characterize the limiting behavior of partial sums of multiplicative functions $f:\mathbb{F}_q[t]\to S^1$. In contrast to the number field setting, the characterization depends crucially on whether the notion of discrepancy is defined…

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

We study large deviations asymptotics for a class of unbounded additive functionals, interpreted as normalized accumulated areas, of one-dimensional Langevin diffusions with sub-linear gradient drifts. Our results provide parametric…

Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

We consider the problem of closeness of solutions of an exact and an averaged difference equations on an infinite interval. Appropriate assertions are derived from one special theorem on the stability under constantly acting perturbations.

We survey results about prime number races, that is, results about the relative sizes of prime counting functions $\pi_{q,a}(x)$, with $q$ fixed and $a$ varying. In particular, we describe recent work by the authors on these problems.

We derive heuristically formula for the $k$--moments $M_k(x)$ of the gaps between consecutive primes$<x $ represented directly by $x$$\pi(x)$ --- the number of primes up to: $M_k(x)= \Gamma(k+1)x^k/\pi^{k-1}(x)+\mathcal{O}(x)$, We…

We generalize the classical Bombieri-Vinogradov theorem to a short interval, non-abelian setting. This leads to variants of the prime number theorem for short intervals where the primes lie in arithmetic progressions that are "twisted" by a…

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

Inferring and comparing complex, multivariable probability density functions is fundamental to problems in several fields, including probabilistic learning, network theory, and data analysis. Classification and prediction are the two faces…