Related papers: Lower Bounds for $L_1$ Discrepancy
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
We develop almost-orthogonality principles for maximal functions associated with averages over line segments and directional singular integrals. Using them, we obtain sharp $L^2$-bounds for these maximal functions when the underlying…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
We consider divergence-based high order discretizations of an $L^2$-based first order system least squares formulation of a second order elliptic equation with Robin boundary conditions. For smooth geometries, we show optimal convergence…
We show that the type function of a space with finite asymptotic dimension estimates its Hilbert (or any $l^p$) compression. The method allows to obtain the lower bound of the compression of the lamplighter group $Z\wr Z$, which has…
This article is a survey of the results on asymptotic behavior of small ball probabilities in $L_2$-norm. Recent progress in this field is mainly based on the methods of spectral theory of differential and integral operators.
In this work, we consider a multivariate regression model with one-sided errors. We assume for the regression function to lie in a general H\"{o}lder class and estimate it via a nonparametric local polynomial approach that consists of…
We present expressions for the coefficients which arise in asymptotic expansions of multiple integrals of Laplace type (the first term of which is known as Laplace's approximation) in terms of asymptotic series of the functions in the…
Second-order two-scale expansions, a unified proof for the regularity of the correctors based on the translation invariant and a lemma for extracting $O(\epsilon)$ from the remainder term are presented for the second order nonlinear…
We provide resolvent asymptotics as well as various operator-norm estimates for the system of linear partial differential equations describing the thin infinite elastic rod with material coefficients which periodically highly oscillate…
We present non-asymptotic two-sided bounds to the log-marginal likelihood in Bayesian inference. The classical Laplace approximation is recovered as the leading term. Our derivation permits model misspecification and allows the parameter…
We find the exact best possible range of those $p > 1$ for which any function which belongs to $A_1(\mathbb{R})$, with $A_1$-constant equal to $c$, must also belong to $L^p$. In this way we provide alternative proofs of the results in [2]…
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…
We calculate the p-the moment of the sum of n independent random variables with respect to symmetric norm in R^n. The order of growth for upper bound p/ln p obtained in ths estimate is optimal. The result extends to generalized Lorentz…
We establish optimal L^p bounds for the nontangential maximal function of the gradient of the solution to a second order elliptic operator in divergence form, possibly non-symmetric, with bounded measurable coefficients independent of the…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
By extending the methods in Peligrad et al. (2014a, b), we establish exact moderate and large deviation asymptotics for linear random fields with independent innovations. These results are useful for studying nonparametric regression with…
The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…
We provide a rather general and very simple to compute lower bound for the asymptotic convergence factor of compact subsets of the set of complex numbers with connected complement and finitely many connected components .
For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of…