Related papers: Kullback-Leibler divergence and primitive non-defi…

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

Let $n$ be a primitive non-deficient number where $n=p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k}$ where $p_1, p_2 \cdots p_k$ are distinct primes. We prove that there exists an $i$ such that $$p_i^{a_i+1} < 2k(p_1p_2p_3\cdots p_k).$$ We conjecture…

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two…

For a class of Lucas sequences ${x_n}$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n = 1, 2, 3 or 6$. This has several desirable consequences.

A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…

The Kullback-Leibler (KL) divergence is a fundamental equation of information theory that quantifies the proximity of two probability distributions. Although difficult to understand by examining the equation, an intuition and understanding…

Discrete normal distributions are defined as the distributions with prescribed means and covariance matrices which maximize entropy on the integer lattice support. The set of discrete normal distributions form an exponential family with…

This work presents an upper-bound to value that the Kullback-Leibler (KL) divergence can reach for a class of probability distributions called quantum distributions (QD). The aim is to find a distribution $U$ which maximizes the KL…

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

Bayesian nonparametric statistics is an area of considerable research interest. While recently there has been an extensive concentration in developing Bayesian nonparametric procedures for model checking, the use of the Dirichlet process,…

The Kullback-Leibler (KL) divergence is a foundational measure for comparing probability distributions. Yet in multivariate settings, its single value often obscures the underlying reasons for divergence, conflating mismatches in individual…

We study primitive divisors of terms of the sequence P_n=n^2+b, for a fixed integer b which is not a negative square. It seems likely that the number of terms with a primitive divisor has a natural density. This seems to be a difficult…

We consider the fundamental problem of estimating a discrete distribution on a domain of size $K$ with high probability in Kullback-Leibler divergence. We provide upper and lower bounds on the minimax estimation rate, which show that the…

In many applications in biology, engineering and economics, identifying similarities and differences between distributions of data from complex processes requires comparing finite categorical samples of discrete counts. Statistical…

Let F(z) be a rational function in Q(z) of degree at least 2 with F(0) = 0 and such that F does not vanish to order d at 0. Let b be a rational number having infinite orbit under iteration of F, and write F^n(b) = A_n/B_n as a fraction in…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

We consider a binary statistical hypothesis testing problem, where $n$ independent and identically distributed random variables $Z^n$ are either distributed according to the null hypothesis $P$ or the alternate hypothesis $Q$, and only $P$…

In this note, we prove that for any given positive integer $\kappa$, when $n$ is bigger than a constant explicitly depending on $\kappa$, the $n$-th Fibonacci number has a primitive divisor not less than $(\kappa+1)n-1$.