Related papers: Noise Correlation Bounds for Uniform Low Degree Fu…
The problem of accurate nonparametric estimation of distributional functionals (integral functionals of one or more probability distributions) has received recent interest due to their wide applicability in signal processing, information…
Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…
We present a straightforward discretization of the Bessel functions $J_n(x)$ to discrete counterparts $B^{(N)}_n(x_m)$, of $N$ integer orders $n$ on $N$ integer points $x_m \equiv m$, that we call discrete Bessel functions. These are built…
Consider the linear space of functions on the binary hypercube and the linear operator $S_\delta$ acting by averaging a function over a Hamming sphere of radius $\delta n$ around every point. It is shown that this operator has a…
In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the non-linearity and differential uniformity of vectorial functions, while the calculation of…
Recent advances in distributed optimization and learning have shown that communication compression is one of the most effective means of reducing communication. While there have been many results on convergence rates under communication…
We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'Donnell and Servedio for regular decision trees. We use this…
We consider the partial theta function $\theta (q,z):=\sum _{j=0}^{\infty}q^{j(j+1)/2}z^j$, where $(q,z)\in \mathbb{C}^2$, $|q|<1$. We show that for any $0<\delta _0<\delta <1$, there exists $n_0\in \mathbb{N}$ such that for any $q$ with…
We compute exact three and four point functions in the W_N minimal models that were recently conjectured to be dual to a higher spin theory in AdS_3. The boundary theory has a large number of light operators that are not only invisible in…
It is shown that the recently introduced lower cone distribution function and the associated set-valued multivariate quantile generate a Galois connection between a complete lattice of closed convex sets and the intervall [0,1]. This…
A universal description of correlation functions of one-dimensional anyonic gapless systems in the low-momentum regime is presented. We point out a number of interesting features, including universal oscillating terms with frequency…
In this paper, we investigate the uniform regularity and asymptotic behavior of solutions to the following Lotka-Volterra type system of strong competition with Dirichlet boundary conditions: \begin{align*} \left\{ \begin{array}{ll} -\Delta…
The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts…
We study relationships between worst-case and random-noise properties of error correcting codes. More concretely, we consider connections between minimum distance, list decoding radius, and block error probability on noisy channels. A…
A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…
We find asymptotic equalities for the exact upper bounds of approximations by Fourier sums of Weyl-Nagy classes $W^r_{\beta,p}, 1\le p\le\infty,$ for rapidly growing exponents of smoothness $r$ $(r/n\rightarrow\infty)$ in the uniform…
We calculate the asymptotic behaviour of correlation functions as a function of the microscopic parameters for a Bose-Fermi mixture with repulsive interaction in one dimension. For two cases, namely polarized and unpolarized fermions the…
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,…
We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…
We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…