Related papers: Restriction estimates using decoupling theorems an…
A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp $L^p-L^q$ restriction…
We analyze the sensitivity of solutions to the Fokker-Planck equation with respect to some unknown parameter. Our main result is to provide quantitative upper bounds for the $p$-Wasserstein distance $\mathcal{W}_p$ between two solutions…
The Fourier restriction problem asks when it is meaningful to restrict the Fourier transform of a function to a given set. Many of the key examples are smooth co-dimension 1 manifolds, although there is increasing interest in fractal sets.…
In this paper, assuming the low-degree conjecture, we provide evidence of computational hardness for two problems: (1) the (partial) matching recovery problem in the sparse correlated Erd\H{o}s-R\'enyi graphs $\mathcal G(n,q;\rho)$ when the…
The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
This paper is motivated by the problem of quantitatively bounding the convergence of adaptive control methods for stochastic systems to a stationary distribution. Such bounds are useful for analyzing statistics of trajectories and…
In this paper we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of…
We show, how the classical Berry-Esseen theorem for normal approximation may be used to derive rates of convergence for random sums of centerd, real-valued random variables with respect to a certain class of probability metrics, including…
We sharpen the constant in the $KS_2$ conjecture of Weaver \cite{We}, which was validated by Marcus, Spielman, and Srivastava \cite{MSS} in their solution of the Kadison--Singer problem. We then apply this result to prove optimal asymptotic…
The data processing inequality is central to information theory and motivates the study of monotonic divergences. However, it is not clear operationally we need to consider all such divergences. We establish a simple method for Pinsker…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
The purpose of this paper is to explain the interest and importance of (approximate) models and model selection in Statistics. Starting from the very elementary example of histograms we present a general notion of finite dimensional model…
Katz and Zahl used a planebrush argument to prove that Kakeya sets in $\mathbb{R}^4$ have Hausdorff dimension at least 3.059. In the special case when the Kakeya set is plany, their argument gives a better lower bound of 10/3. We give a…
We consider the wave equation with a boundary condition of memory type. Under natural conditions on the acoustic impedance $\hat{k}$ of the boundary one can define a corresponding semigroup of contractions (Desch, Fasangova, Milota, Probst…
Katugampola's 2015 study of generalized fractional differential operators produced triangular arrays of integer coefficients indexed by a fractional order r and by dimensions n and k, but no combinatorial interpretation has been established…
An equivalent definition of the Fibonacci numbers is that they are the unique sequence such that every integer can be written uniquely as a sum of non-adjacent terms. We can view this as we have bins of length 1, we can take at most one…
We propose the extension of Fr\'{e}chet-Hoeffding copula bounds for circular data. The copula is a powerful tool for describing the dependency of random variables. In two dimensions, the Fr\'{e}chet-Hoeffding upper (lower) bound indicates…
Continuous-time Markov chains associated to finite-volume discretization schemes of Fokker-Planck equations are constructed. Sufficient conditions under which quantitative exponential decay in the $\phi$-entropy and Wasserstein distance are…