Related papers: BiEntropy, TriEntropy and Primality
We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…
Let $ B_{\ell}(n)$ denote the number of $\ell$-regular bipartitions of $n.$ In this article, we prove that $ B_{\ell}(n)$ is always almost divisible by $p_i^j$ if $p_i^{2a_i}\geq \ell,$ where $j$ is a fixed positive integer and…
The posterior distribution in a nonparametric inverse problem is shown to contract to the true parameter at a rate that depends on the smoothness of the parameter, and the smoothness and scale of the prior. Correct combinations of these…
The sequence of entropy numbers quantifies the degree of compactness of a linear operator acting between quasi-Banach spaces. We determine the asymptotic behavior of entropy numbers in the case of natural embeddings between…
The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…
Rubinstein and Sarnak investigated systems of inequalities of the form pi(x;q,a_1) > ... > pi(x;q,a_r), where pi(x;q,a) denotes the number of primes up to x that are congruent to a mod q. They showed, under standard hypotheses on the zeros…
The concept of biased data is well known and its practical applications range from social sciences and biology to economics and quality control. These observations arise when a sampling procedure chooses an observation with probability that…
Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum…
Estimating the difference between two binomial proportions will be investigated, where Bayesian, frequentist and fiducial (BFF) methods will be considered. Three vague priors will be used, the Jeffreys prior, a divergence prior and the…
Building on ideas from Castillo and Nickl [Ann. Statist. 41 (2013) 1999-2028], a method is provided to study nonparametric Bayesian posterior convergence rates when "strong" measures of distances, such as the sup-norm, are considered. In…
We show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…
We prove that information-theoretic maximum entropy (MaxEnt) approach to canonical ensemble is mathematically equivalent to the classic approach of Boltzmann, Gibbs and Darwin-Fowler. The two approaches, however, "interpret" a same…
We show that when the proportions of a countable set of species are organized as an exchangeable partition of the unit interval and we take a sample on it, then the Bayesian posterior entropy converges a.s. and in L^1 to the entropy of the…
The latest cosmological constraints on the sum of neutrino masses, in combination with the latest laboratory measurements on oscillations, provide ``decisive" Bayesian evidence for the normal neutrino mass hierarchy. We show that this…
We prove a sharp bound between sampling numbers and entropy numbers in the uniform norm for bounded convex sets of bounded functions.
Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$. We establish that the set $\mathcal{C}$ of covering…