Related papers: Approximate substitutions and the normal ordering …
In this paper, we consider the generalized low rank approximation of the correlation matrices problem which arises in the asset portfolio. We first characterize the feasible set by using the Gramian representation together with a special…
A new model of bosonic strings is considered. An action of the model is the sum of the standard string action and a term describing an interaction of a metric with a linear (affine) connection. The Lagrangian of this interaction is an…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
In the article we propose a general scheme for solutions of some approximation problems under a rather general setting. We illustrate the application of the proposed scheme by a series of examples, in particular we show that many results in…
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…
We consider the Stokes equations on a bounded perforated domaincompleted with non-zero constant boundary conditions on the holes. We investigate configurations forwhich the holes are identical spheres and their number N goes to infinity…
We derive the conditions that the coupling constants of the Generalized Thirring Model have to satisfy in order for the model to admit an infinite number of commuting classical conserved quantities. Our treatment uses the bosonized version…
We study pure exploration problems in which the set of correct answers is possibly infinite. For example, such problems arise when regressing a continuous function on the means of the bandit or when learning Nash equilibria by querying…
We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It…
In the first part of this paper, we establish a conditional optimality result for an adaptive mixed finite element method for the stationary Stokes problem discretized by the standard Taylor-Hood elements, under the assumption of the…
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…
Given a set S of integers whose sum is zero, consider the problem of finding a permutation of these integers such that: (i) all prefix sums of the ordering are nonnegative, and (ii) the maximum value of a prefix sum is minimized. Kellerer…
Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be…
In this paper we describe a new family of algebras which in the case of n = 2 reduces to the Fermion algebra and in the limiting case of n tends to infinity reduces to the Boson algebra. These generalized algebras describe particles which…
We propose a novel reformulation of the stochastic optimal control problem as an approximate inference problem, demonstrating, that such a interpretation leads to new practical methods for the original problem. In particular we characterise…
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…
We have proposed a method in the context of BFFT approach that leads to truncation of the infinite series regarded to constraints in the extended phase space, as well as other physical quantities (such as Hamiltonian). This has been done…
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…
In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…
We define regularised Poisson brackets for the monodromy matrix of classical string theory on R x S^3. The ambiguities associated with Non-Ultra Locality are resolved using the symmetrisation prescription of Maillet. The resulting brackets…