Related papers: Optimal $L_p$-discrepancy bounds for second order …
We investigate the minimal error in approximating a general probability measure $\mu$ on $\mathbb{R}^d$ by the uniform measure on a finite set with prescribed cardinality $n$. The error is measured in the $p$-Wasserstein distance. In…
The maximal inequalities for diffusion processes have drawn increasing attention in recent years. However, the existing proof of the $L^p$ maximum inequalities for the Ornstein-Uhlenbeck process was dubious. Here we give a rigorous proof of…
The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…
We establish $L^p$ error estimates for monotone numerical schemes approximating Hamilton-Jacobi equations on the $d$-dimensional torus. Using the adjoint method, we first prove a $L^1$ error bound of order one for finite-difference and…
Korten and Pitassi (FOCS, 2024) defined a new complexity class $L_2^P$ as the polynomial-time Turing closure of the Linear Ordering Principle. They put it between $MA$ (Merlin--Arthur protocols) and $S_2^P$ (the second symmetric level of…
We prove $L^p$ bounds in the range $1<p<\infty$ for a maximal dyadic sum operator on $\rn$. This maximal operator provides a discrete multidimensional model of Carleson's operator. Its boundedness is obtained by a simple twist of the proof…
In this paper, we revisit the discrete lossy Gray-Wyner problem. In particular, we derive its optimal second-order coding rate region, its error exponent (reliability function) and its moderate deviations constant under mild conditions on…
Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…
In this paper we study general $l_p$ regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of first- and second-order stationary points, and hence also of local minimizers of the $l_p$…
The paper derives the optimal second-order coding rate for the continuous-time Poisson channel. We also obtain bounds on the third-order coding rate. This is the first instance of a second-order result for a continuous-time channel. The…
In this paper, we give some $l_p$-type inequalities about sequences satisfying certain quasi monotone type properties. As special cases, reverse $l_p$-type inequalities for non-negative decreasing sequences are obtained. The inequalities…
A longstanding open problem in coding theory is to determine the best (asymptotic) rate $R_2(\delta)$ of binary codes with minimum constant (relative) distance $\delta$. An existential lower bound was given by Gilbert and Varshamov in the…
Various perturbation series are factorially divergent. The behavior of their high-order terms can be found by Lipatov's method, according to which they are determined by the saddle-point configurations (instantons) of appropriate functional…
In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…
We establish an $L_1$-bound between the coefficients of the optimal causal filter applied to the data-generating process and its finite sample approximation. Here, we assume that the data-generating process is a second-order stationary time…
Let $D$ be a nonnegative integer and ${\mathbf{\Theta}}\subset S^1$ be a lacunary set of directions of order $D$. We show that the $L^p$ norms, $1<p<\infty$, of the maximal directional Hilbert transform in the plane $$ H_{{\mathbf{\Theta}}}…
In his beautiful paper [1], Ben Andrews obtained the complete classification of the solutions of the planar isotropic $L_p$ Minkowski problem. In this paper, by generalizing Ben Andrews's result we obtain the complete classification of the…
Entropy numbers are an important tool for quantifying the compactness of operators. Besides establishing new upper bounds on the entropy numbers of diagonal operators $D_\sigma$ from $\ell_p$ to $\ell_q$, where $p\not=q$, we investigate the…
We establish a Dahlberg-type perturbation theorem for second order divergence form elliptic operators with complex coefficients. In our previous paper, we showed the following result: If ${\mathcal L}_0=\mbox{div}…
We propose an algorithm to numerically determined whether a second-order linear PDE problem satisfying a Garding inequality is well-posed. This algorithm further provides a lower bound to the inf-sup constant of the weak formulation, which…