Related papers: An explicit two-source extractor with min-entropy …
How to generate provably true randomness with minimal assumptions? This question is important not only for the efficiency and the security of information processing, but also for understanding how extremely unpredictable events are possible…
Seeded extractors are fundamental objects in pseudorandomness and cryptography, and a deep line of work has designed polynomial-time seeded extractors with nearly-optimal parameters. However, existing constructions of seeded extractors with…
Recently (in 2011) several new theorems concerning this conjecture were proved by Bourgain and Kontorovich. The easiest of them states that the set of numbers satisfying Zaremba's conjecture with A=50 has positive proportion in $\N.$ The…
We develop a new method for bounding the relative entropy of a random vector in terms of its Stein factors. Our approach is based on a novel representation for the score function of smoothly perturbed random variables, as well as on the de…
The discounted central limit theorem concerns the convergence of an infinite discounted sum of i.i.d. random variables to normality as the discount factor approaches $1$. We show that, using the Fourier metric on probability distributions,…
We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We…
We introduce a new probabilistic technique for finding 'almost-periods' of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need…
We consider synthesis and analysis of probability measures using the entropy-regularized Wasserstein-2 cost and its unbiased version, the Sinkhorn divergence. The synthesis problem consists of computing the barycenter, with respect to these…
This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…
For a fixed flow-based generative model under a small inference budget, sample quality can depend strongly on where the sampler spends its few function evaluations. Flow matching and Schr\"odinger bridges define probability paths, yet their…
The paper search for the minimum of the entropy of a two- dimensional distribution in the Fr\'echet class, the class of distributions with given marginals. The main result for discrete distributions is an algorithm for building the…
Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…
The Fourier decay rate of a coin-tossing type measure is investigated. Explicit estimation is given. Our method relies upon a classical result of Hartman and Kershner. As an application, we present a new example of a measure whose Fourier…
Motivated by string theory scattering amplitudes that are invariant under a discrete U-duality, we study Fourier coefficients of Eisenstein series on Kac-Moody groups. In particular, we analyse the Eisenstein series on $E_9(R)$, $E_{10}(R)$…
We establish a quantitative statement: baryogenesis driven by a purely oscillatory (zero-mean) chemical potential is parametrically suppressed under smooth freeze-out (adiabatic cancellation). A simple toy model yields an analytic low-pass…
Weakly almost i.i.d. quantum sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We establish…
We develop a computationally tractable method for estimating the optimal map between two distributions over $\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our…
We demonstrate that a minor modification of the extrapolation proposed by Jensen [(2005): Theor Chem Acc 113:267] yields very reliable estimates of the Hartree-Fock limit in conjunction with correlation consistent basis sets. Specifically,…
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT). For 35 years the split-radix algorithm…
Consider the set of source distributions within a fixed maximum relative entropy with respect to a given nominal distribution. Lossless source coding over this relative entropy ball can be approached in more than one way. A problem…