English
Related papers

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

200 papers

We study concentration inequalities for the Kullback--Leibler (KL) divergence between the empirical distribution and the true distribution. Applying a recursion technique, we improve over the method of types bound uniformly in all regimes…

Information Theory · Computer Science 2019-10-22 Jay Mardia , Jiantao Jiao , Ervin Tánczos , Robert D. Nowak , Tsachy Weissman

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

Number Theory · Mathematics 2013-05-28 G. Everest , S. Stevens , D. Tamsett , T. Ward

In this paper, we investigate the validity of a quantitative version of stability for the critical Hardy-H\'enon equation \begin{equation*} H(u):=\div(|x|^{-2a}\nabla u)+|x|^{-pb}|u|^{p-2}u=0,\quad u\in D_a^{1,2}(\R^n), \end{equation*}…

Analysis of PDEs · Mathematics 2026-01-23 Yuxuan Zhou , Wenming Zou

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

Number Theory · Mathematics 2024-06-07 Christian Axler

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

Number Theory · Mathematics 2021-09-22 Tomohiro Yamada

The families of $f$-divergences (e.g. the Kullback-Leibler divergence) and Integral Probability Metrics (e.g. total variation distance or maximum mean discrepancies) are widely used to quantify the similarity between probability…

Statistics Theory · Mathematics 2021-06-08 Rohit Agrawal , Thibaut Horel

Several scalable sample-based methods to compute the Kullback Leibler (KL) divergence between two distributions have been proposed and applied in large-scale machine learning models. While they have been found to be unstable, the…

Machine Learning · Computer Science 2021-09-07 Sandesh Ghimire , Prashnna K Gyawali , Linwei Wang

In 2000 Deaconescu raised a question whether there exists a composite $n$ for which $S_2(n)|\phi(n)-1$, where $\phi(n)$ is Euler's function and $S_2(n)$ is Schemmel's totient function. In this paper we prove that any such $n$ is odd,…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…

Algebraic Geometry · Mathematics 2020-05-20 Eduardo Ruíz Duarte , Marc Paul Noordman

Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for…

Number Theory · Mathematics 2007-05-23 Kirsten Eisentraeger

The Kullback-Leibler (KL) divergence is not a proper distance metric and does not satisfy the triangle inequality, posing theoretical challenges in certain practical applications. Existing work has demonstrated that KL divergence between…

Machine Learning · Statistics 2026-03-03 Shiji Xiao , Yufeng Zhang , Chubo Liu , Yan Ding , Keqin Li , Kenli Li

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Number Theory · Mathematics 2022-01-06 Błażej Żmija

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

Number Theory · Mathematics 2020-07-08 Tewodros Amdeberhan , Victor H. Moll , Vaishavi Sharma , Diego Villamizar

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

General Mathematics · Mathematics 2021-08-24 Masum Billal

Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)\cdots f(m)$. We prove that if $m > \max\{10^{12},4^{n+1}\}$, then there exists a prime divisor…

Number Theory · Mathematics 2019-12-10 Stephan Baier , Pallab Kanti Dey

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

General Mathematics · Mathematics 2017-09-13 Sandor Kristyan

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two…

Computer Science and Game Theory · Computer Science 2025-09-23 Max Dupre la Tour , Kaito Fujii

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

Number Theory · Mathematics 2007-07-31 Tomohiro Yamada

Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.

Rings and Algebras · Mathematics 2013-12-11 Pere Ara , Jason P. Bell

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice