Related papers: Poisson-Dirichlet approximation for counting integ…
We study the distribution of normalized spacings between the fractional parts of an^2, n=1,2,.... We conjecture that if a is "badly approximable" by rationals, then the sequence of fractional parts has Poisson spacings, and give a number of…
By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…
This work establishes computable bounds between f-divergences for probability measures within a generalized quasi-$\varepsilon_{(M,m)}$-neighborhood framework. We make the following key contributions. (1) a unified characterization of local…
Recently, Aum\"uller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called "Count", which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this note we provide further…
We determine, up to multiplicative constants, the number of integers $n\le x$ that have no prime factor $\le w$ and a divisor in $(y,2y]$. Our estimate is uniform in $x,y,w$. We apply this to determine the order of the number of distinct…
In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…
An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…
We show that the sequence of integers which have nearly the typical number of distinct prime factors forms a Poisson process. More precisely, for $\de$ arbitrarily small and positive, the nearest neighbor spacings between integers $n$ with…
A classical result due to Deshouillers, Dress and Tenenbaum asserts that on average the distribution of the divisors of the integers follows the arcsine law. In this paper, we investigate the distribution of smooth divisors of the integers,…
Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…
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.
This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer…
We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box $[-X,X]^4$ that satisfy the determinant equation $x_1x_2-x_3x_4=r$ for $r \neq 0$ with two of entries to be…
Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.
In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…
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…
In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…
We consider certain finite sets of circle-valued functions defined on intervals of real numbers and estimate how large the intervals must be for the values of these functions to be uniformly distributed in an approximate way. This is used…
For an unknown continuous distribution on a real line, we consider the approximate estimation by the discretization. There are two methods for the discretization. First method is to divide the real line into several intervals before taking…
We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…