相关论文: An improved lower bound for the $L_2$-discrepancy

It is known that the surface of a cone over the unit disc with large height has smaller distortion than the standard embedding of the 2-sphere in $\mathbb R^3$. In this note we show that distortion minimisers exist among convex embedded…

We prove a lower bound for the large sieve with square moduli.

We consider the series expansion of the $L^p$-Hardy inequality of \cite{BFT2}, in the particular case where the distance is taken from an interior point of a bounded domain in $\mathbb{R}^n$ and $1<p\neq n$. For $p<n$ we improve it by…

We prove a new lower bound for the exponent of growth of the best two-dimensional Diophantine approximations with respect to Euclidean norm.

This paper is a follow-up to the recent paper "A note on isotropic discrepancy and spectral test of lattice point sets" [J. Complexity, 58:101441, 2020]. We show that the isotropic discrepancy of a lattice point set is at most $d \,…

$f$-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics and information theory such as Kullback-Leibler…

We establish L^p bounds on L^2 normalized spectral clusters for self-adjoint elliptic Dirichlet forms with Lipschitz coefficients. In two dimensions we obtain best possible bounds for all p between $2 and infinity, up to logarithmic losses…

We prove Inequalities similar to those of Bernstein for non-periodic splines in $L_2$ space.

This paper establishes optimal error estimates in the $L^2$ for the non-symmetric Nitsche method in an unfitted interface finite element setting. Extending our earlier work, we give a complete analysis for the Poisson interface model and,…

This paper studies the expected $L_p$-discrepancy ($2 \leq p < \infty$) for stratified sampling schemes under importance sampling. We introduce a parametric family of equivolume partitions $\Omega_{\theta,\sim}$ and leverage recent exact…

The construction of low-discrepancy sets, used for uniform sampling and numerical integration, has recently seen great improvements based on optimization and machine learning techniques. However, these methods are computationally expensive,…

In this article, we obtain an upper bound for the number of integral points on the del Pezzo surfaces of degree two.

We discuss upper and lower bounds for the $L^2$ restriction norm of a Maass form on $\SL{n+1}{Z}$.

We show that the isotropic discrepancy of a lattice point set can be bounded from below and from above in terms of the spectral test of the corresponding integration lattice. From this we deduce that the isotropic discrepancy of any…

Linear Least Squares is a very well known technique for parameter estimation, which is used even when sub-optimal, because of its very low computational requirements and the fact that exact knowledge of the noise statistics is not required.…

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…

We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to…

We consider parabolic Bellman equations with Lipschitz coefficients. Error bounds of order $h^{1/2}$ for certain types of finite-difference schemes are obtained.

We show how to improve the discrepancy of an iid sample by moving only a few points. Specifically, modifying \( O(m) \) sample points on average reduces the Kolmogorov-Smirnov distance to the population distribution to \(1/m\).