Related papers: Spacings between integers having typically many pr…
By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange's Tauberian theorems, we show that the number of factors in random ordered factorizations of integers is asymptotically normally distributed.
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
We study a local thinning $T_r$ that retains a point with probability $p(n_r)$, where $n_r$ counts neighbors within radius $r$. For Poisson input with spatially varying intensity, we obtain an exact intensity via a Poisson--mixture formula…
We study short intervals which contain an ``almost square'', an integer $n$ that can be factored as $n = ab$ with $a$, $b$ close to $\sqrt{n}$. This is related to the problem on distribution of $n^2 \alpha \pmod 1$ and the problem on gaps…
For a prime number $p$, we consider its primorial $P:=p\#$ and $U(P):={\left(\mathbb{Z}/P\mathbb{Z}\right)}^\times$ the set of elements of the multiplicative group of integers modulo $P$ which we represent as points anticlockwise on a…
We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…
The distribution of the ratios of nearest neighbor level spacings has become a popular indicator of spectral fluctuations in complex quantum systems like interacting many-body localized and thermalization phases, quantum chaotic systems,…
For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…
Traditional Insertion Sort runs in O(n^2) time because each insertion takes O(n) time. When people run Insertion Sort in the physical world, they leave gaps between items to accelerate insertions. Gaps help in computers as well. This paper…
Given a homogeneous Poisson process on ${\mathbb{R}}^d$ with intensity $\lambda$, we prove that it is possible to partition the points into two sets, as a deterministic function of the process, and in an isometry-equivariant way, so that…
A compound Poisson process whose randomized time is an independent Poisson process is called compound Poisson process with Poisson subordinator. We provide its probability distribution, which is expressed in terms of the Bell polynomials,…
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an…
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…
We study the spacing of the primes using methods from information theory. In information theory, the equivalence of continuous and discrete representations of information is established by Shannon sampling theory. Here, we use Shannon…
Clusters traverse a gas and collide with gas particles. The gas particles are adsorbed and the clusters become hosts. If the clusters are size selected, the number of guests will be Poisson distributed. We review this by showcasing four…
We study point processes that consist of certain centers of point tuples of an underlying Poisson process. Such processes arise in stochastic geometry in the study of exceedances of various functionals describing geometric properties of the…
We establish a general inequality on the Poisson space, yielding an upper bound for the distance in total variation between the law of a regular random variable with values in the integers and a Poisson distribution. Several applications…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…
Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. For an integer $m$,…