Related papers: Approximate substitutions and the normal ordering …
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We construct an approximate static gravitational solution of the Einstein equations, with negative cosmological constant, describing a test black string stretching from the boundary of the Schwarzschild-AdS_5 black brane toward the horizon.…
For curved projective manifolds we introduce a notion of a normal tractor frame field, based around any point. This leads to canonical systems of (redundant) coordinates that generalise the usual homogeneous coordinates on projective space.…
We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a…
Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…
We present iterative solvers to approximate the solution of numerical schemes for stochastic Stefan problems. After briefly talking about the convergence results, we tackle the question of efficient strategies for solving the nonlinear…
We approximate an elliptic problem with oscillatory coefficients using a problem of the same type, but with constant coefficients. We deliberately take an engineering perspective, where the information on the oscillatory coefficients in the…
We consider the sparse optimization problem with nonlinear constraints and an objective function, which is given by the sum of a general smooth mapping and an additional term defined by the $ \ell_0 $-quasi-norm. This term is used to obtain…
We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a constraint language specifying the relations that may be used in…
We address a systematic combinatorial approach to the anti-normal ordering problem. In this way, we use the Stirling numbers and their generating function, the so-called Bell polynomials, together with the operational methods to anti-normal…
We find an exact general solution to the three-dimensional (3D) Ising model via an exact self-consistency equation for nearest-neighbors' correlations. It is derived by means of an exact solution to the recurrence equations for partial…
We develop and analyze an inexact regularized alternating projection method for nonconvex feasibility problems. Such a method employs inexact projections on one of the two sets, according to a set of well-defined conditions. We prove the…
Large sectors of the recent optimization literature focused in the last decade on the development of optimal stochastic first order schemes for constrained convex models under progressively relaxed assumptions. Stochastic proximal point is…
We generalize to the case of compactified superstrings a construction given previously for critical superstrings of finite one loop amplitudes that are well-defined for all external momenta. The novel issues that arise for compactified…
We study the strong convergence and bounded perturbation resilience of iterative algorithms based on the Generalized Modular String-Averaging (GMSA) procedure for infinite sequences of input operators under a general admissible control.…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
We introduce a global scheme on the n-torus of a controlled incompressible Navier-Stokes equation in terms of a coupled controlled infinite ODE-system of Fourier-modes with smooth data. We construct a scheme of global approximations related…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…
The divergences that arise in the regularized partition function for closed bosonic string theory in flat space lead to three types of perturbation series expansions, distinguished by their genus dependence. This classification of…