相关论文: The realizability problem as a special case of the…

In this paper we study the truncated power moment problem with an odd number of prescribed moments. A Nevanlinna-type formula is derived for this moment problem in the case when the moment problem has more than one solution (the…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

Many real life problems can be reduced to the solution of a complex exponentials approximation problem which is usually ill posed. Recently a new transform for solving this problem, formulated as a specific moments problem in the plane, has…

We present an alternative solution to nonsingular cubic moment problems, using techniques that are expected to be useful for higher-degree truncated moment problems. In particular, we apply the theory of recursively determinate moment…

We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter. In the realizability…

Mixed-moment models, introduced before for one space dimension, are a modification of the method of moments applied to a (linear) kinetic equation, by choosing mixtures of different partial moments. They are well-suited to handle such…

In this paper we introduce the "tracial $K$-moment problem" and the "sequential matrix-valued $K$-moment problem" and show the equivalence of the solvability of these problems. Using a Haviland's theorem for matrix polynomials, we solve…

A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…

We continue the study of truncated matrix-valued moment problems begun in arXiv:2310.00957. Let $q\in\mathbb{N}$. Suppose that $(\mathcal{X},\mathfrak{X})$ is a measurable space and $\mathcal{E}$ is a finite-dimensional vector space of…

We study a class of design problems in solid mechanics, leading to a variation on the classical question of equi-dimensional embeddability of Riemannian manifolds. In this general new context, we derive a necessary and sufficient existence…

We solve the truncated K-moment problem when $K\subseteq R^n$ is the closure of a, not necessarily bounded, open set (which includes the important cases $K=R^n$ and $K=R^n_+$). That is, we completely characterize the interior of the convex…

In this paper we study truncated moment problems for $J$-self-adjoint, $J$-skew-self-adjoint and $J$-unitary operators. Conditions of the solvability are given. Some canonical solutions of the moment problems are constructed. As a…

We give a version of the Riesz-Haviland theorem for truncated moments problems, characterizing the existence of the representing measures that are absolutely continuous with respect to the Lebesgue measure. The existence of such…

We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…

A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus…

In this paper, we propose a new easily implementable method for solving a class of semi-infinite programs, where an approximate linear semidefinite program is constructed for the concerned semi-infinite program based on the duality theory…

This paper is a continuation of our previous investigations on the truncated matrix trigonometric moment problem in Ukrainian Math. J., 2011, \textbf{63}, no. 6, 786-797, and Ukrainian Math. J., 2013, \textbf{64}, no. 8, 1199-1214. In this…

In this paper, the reachability of dimension-bounded linear systems is investigated.Since state dimensions of dimension-bounded linear systems vary with time, the expression of state dimension at each time is provided.A method for judging…

We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such…

Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with…