Related papers: On "Upper error bounds for quadrature formulas on …
We introduce manifestly crossing-symmetric expansions for arbitrary systems of 1D CFT correlators. These expansions are given in terms of certain Polyakov blocks which we define and show how to compute efficiently. Equality of OPE and…
Corrected trapezoidal rules are proved for $\int_a^b f(x)\,dx$ under the assumption that $f"\in L^p([a,b])$ for some $1\leq p\leq\infty$. Such quadrature rules involve the trapezoidal rule modified by the addition of a term…
The fractional calculus of variations and fractional optimal control are generalizations of the corresponding classical theories, that allow problem modeling and formulations with arbitrary order derivatives and integrals. Because of the…
Frolov's cubature formula on the unit hypercube has been considered important since it attains an optimal rate of convergence for various function spaces. Its integration nodes are given by shrinking a suitable full rank…
Aaronson and Ambainis (SICOMP `18) showed that any partial function on $N$ bits that can be computed with an advantage $\delta$ over a random guess by making $q$ quantum queries, can also be computed classically with an advantage $\delta/2$…
It is proved that one cannot approximate stably the first derivative of a smooth function given noisy values of this function and a bound on this function and its first derivative. Such an approximation is shown to be possible if an a…
We investigate quasi-Monte Carlo rules for the numerical integration of multivariate periodic functions from Besov spaces $S^r_{p,q}B(\mathbb{T}^d)$ with dominating mixed smoothness $1/p<r<2$. We show that order 2 digital nets achieve the…
A classic result of Cook et al. (1986) bounds the distances between optimal solutions of mixed-integer linear programs and optimal solutions of the corresponding linear relaxations. Their bound is given in terms of the number of variables…
In this paper, we study optimization problems of numerical differentiation and summation methods on classes of univariate functions. Sharp estimates (in order) of the optimal recovery error and information complexity are calculated for…
The methods commonly used for numerical differentiation, such as the "center-difference formula" and "four-points formula" are unusable in simulations or real-time data analysis because they require knowledge of the future. In Bard'11, an…
We give an improved lower bound for the error of any quadrature computing $\int_{-1}^1 f(x) d\alpha(x)$ of analytic functions bounded in the neighborhood of $[-1,1]$.
We prove a functional extension of an exponential inequality originally proposed by Bin Zhao and proved by Xiaosheng Mou. The main result asserts that if $\alpha_1\leq \cdots\leq \alpha_n$ and $\sum_{k=1}^n \alpha_k=0$, then \[ \sum_{k=1}^n…
We consider the problem of online multiclass U-calibration, where a forecaster aims to make sequential distributional predictions over $K$ classes with low U-calibration error, that is, low regret with respect to all bounded proper losses…
We solve the Stechkin problem about approximation of generally speaking unbounded hypersingular integral operators by bounded ones. As a part of the proof, we also solve several related and interesting on their own problems. In particular,…
We prove that a class of randomized integration methods, including averages based on $(t,d)$-sequences, Latin hypercube sampling, Frolov points as well as Cranley-Patterson rotations, consistently estimates expectations of integrable…
We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…
Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…
Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows…
Prior recent work, devoted to the study of polynomial Krylov techniques for the approximation of the action of the matrix exponential ${\rm e}^{tA}v$, is extended to the case of associated $\varphi$-functions (which occur within the class…
We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…