SearcharxivSearch

arXiv subjects

Anay Aggarwal

Publications and source records attributed to Anay Aggarwal.

4 recordsLinked to original sources

Resolution of a Conjecture on Shifted R'enyi Divergence

Altschuler and Chewi conjecture that the sub-Gaussian Orlicz--Wasserstein shifted R\'enyi divergence between two isotropic Gaussians of equal covariance is attained by a deterministic shift of the mean, which would give an exact closed form for the shift budget consumed by their analysis. In this note, we show that this conjecture is true when $q=1$, where the R\'enyi divergence degenerates to the Kullback--Leibler divergence, and false for every $q>1$ outside the degenerate regime.

math.PR

On integers with many representations as the sum of $k$th powers of primes

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively answers a conjecture of Erdos, which asks if there are natural numbers $n$ with arbitrarily many distinct representations of the form $p_1^k+p_2^k+\dots+p_k^k$ for primes $p_1,p_2,\dots,p_k$.

math.NT

On primality and atomicity of numerical power monoids

In the first part of this paper, we establish a variation of a recent result by Bienvenu and Geroldinger on the (almost) non-existence of absolute irreducibles in (restricted) power monoids of numerical monoids: we argue the (almost) non-existence of primal elements in the same class of power monoids. The second part of this paper, devoted to the study of the atomic density of $\mathcal{P}_{\text{fin}, 0}(\mathbb{N}_0)$, is motivated by work of Shitov, a recent paper by Bienvenu and Geroldinger, and some questions pointed out by Geroldinger and Tringali. In the same, we study atomic density through the lens of the natural partition $\{ \mathcal{A}_{n,k} : k \in \mathbb{N}_0\}$ of $\mathcal{A}_n$, the set of atoms of $\mathcal{P}_{\text{fin}, 0}(\mathbb{N}_0)$ with maximum at most $n$: \[ \mathcal{A}_{n,k} = \{A \in \mathcal{A} : \max A \le n \text{ and } |A| = k\} \] for all $n,k \in \mathbb{N}$, where $\mathcal{A}$ is the set of atoms of $\mathcal{P}_{\text{fin}, 0}(\mathbb{N}_0)$. We pay special attention to the sequence $(\alpha_{n,k})_{n,k \ge 1}$, where $\alpha_{n,k}$ denote the size of the block $\mathcal{A}_{n,k}$. First, we establish some bounds and provide some asymptotic results for $(\alpha_{n,k})_{n,k \ge 1}$. Then, we take some probabilistic approach to argue that, for each $n \in \mathbb{N}$, the sequence $(\alpha_{n,k})_{k \ge 1}$ is almost unimodal. Finally, for each $n \in \mathbb{N}$, we consider the random variable $X_n : \mathcal{A}_n \to \mathbb{N}_0$ defined by the assignments $X_n : A \mapsto |A|$, whose probability mass function is $\mathbb{P}(X_n=k) = \alpha_{n,k}/| \mathcal{A}_n|$. We conclude proving that, for each $m \in \mathbb{N}$, the sequence of moments $(\mathbb{E}(X_n^m))_{n \ge 1}$ behaves asymptotically as that of a sequence $(\mathbb{E}(Y_n^m))_{n \ge 1}$, where $Y_n$ is a binomially distributed random variable with parameters $n$ and $\frac12$.

math.CO

An Elementary Method For Fast Modular Exponentiation With Factored Modulus

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1, e_i]$ for $1\le i\le k$. Then we can compute the modular exponentiation $a^n\pmod{m}$ in $O(\max(e_i/t_i)+\sum_{i=1}^k t_i\log p_i)$ steps (i.e., modular operations). We go on to analyze this algorithm mathematically and programmatically, showing significant asymptotic improvement in specific cases. Specifically, for an infinite family of $m$ we achieve a complexity of $O(\sqrt{\log m})$ steps, much faster than the Repeated Squaring Algorithm, which has complexity $O(\log m)$. Additionally, we extend our algorithm to matrices and hence general linear recurrences. The complexity is similar; with the same setup we can exponentiate matrices in $GL_d(\mathbb{Z}/m\mathbb{Z})$ in less than $O(\max(e_i/t_i)+d^2\sum_{i=1}^k t_i\log p_i)$ steps. This improves Fiduccia's algorithm and the results of Bostan and Mori in the case of $\mathbb{Z}/m\mathbb{Z}$. We prove analogous results for $\mathbb{Z}/p^k\mathbb{Z}$ ring extensions.

math.NT