Related papers: Upper and lower estimates for numerical integratio…

We study multivariate integration of functions that are invariant under permutations (of subsets) of their arguments. We find an upper bound for the $n$th minimal worst case error and show that under certain conditions, it can be bounded…

In the present paper, optimal quadrature formulas in the sense of Sard are constructed for numerical integration of the integral $\int_a^be^{2\pi i\omega x}\varphi(x)d x$ with $\omega\in \mathbb{R}$ in the Sobolev space $L_2^{(m)}[a,b]$ of…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…

We give sharp limiting case Hardy inequalities on the sphere $\mathbb{S}^{2}$ and show that their optimal constants are unattainable by any $f\in H^{1}\left(\mathbb{S}^{2}\right)\setminus\{0\}$. The singularity of the problem is related to…

We show that one can obtain logarithmic improvements of $L^2$ geodesic restriction estimates for eigenfunctions on 3-dimensional compact Riemannian manifolds with constant negative curvature. We obtain a $(\log\lambda)^{-\frac12}$ gain for…

We prove new Fourier restriction estimates to the unit sphere $S^{d-1}$ on the class of $O(d-k)\times O(k)$-symmetric functions, for every $d\geq 4$ and $2\leq k\leq d-2$. As an application, we establish the existence of maximizers for the…

Linear fixed point equations in Hilbert spaces arise in a variety of settings, including reinforcement learning, and computational methods for solving differential and integral equations. We study methods that use a collection of random…

In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space…

We investigate asymptotically sharp upper and lower bounds for the approximation numbers of the compact Sobolev embeddings $\overset{\circ}{W}{^m}(\Omega)\hookrightarrow L_2(\Omega)$ and $ W^m(\Omega)\hookrightarrow L_2(\Omega)$, defined on…

We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the…

For the accurate representation and reconstruction of band-limited signals on the sphere, an optimal-dimensionality sampling scheme has been recently proposed which requires the optimal number of samples equal to the number of degrees of…

We prove an extension of the Stein-Weiss weighted estimates for fractional integrals, in the context of Lp spaces with different integrability properties in the radial and the angular direction. In this way, the classical estimates can be…

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

For a distribution function $F$ on $\mathbb{R}^d$ and a point $q\in \mathbb{R}^d$, the \emph{spherical depth} $\SphD(q;F)$ is defined to be the probability that a point $q$ is contained inside a random closed hyper-ball obtained from a pair…

The conventional rounding error analysis provides worst-case bounds with an associated failure probability and ignores the statistical property of the rounding errors. In this paper, we develop a new statistical rounding error analysis for…

Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…

The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…

In this paper, the paradigm of sphere decoding (SD) for solving the integer least square problem (ILS) is revisited, where extra degrees of freedom are introduced to exploit the decoding potential. Firstly, the equivalent sphere decoding…