Related papers: SPM Bulletin 12

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

In this paper, we resolve the computational complexity of a number of outstanding open problems with practical applications. Here is the list of problems we show to be PPAD-complete, along with the domains of practical significance:…

In this paper, we introduce Mellin-Steklov exponential samplingoperators of order $r,r\in\mathbb{N}$, by considering appropriate Mellin-Steklov integrals. We investigate the approximation properties of these operators in continuousbounded…

While the classic separable quotient problem remains open, we survey general results related to this problem and examine the existence of a particular infinitedimensional separable quotient in some Banach spaces of vector-valued functions,…

The main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…

Here we deal with some problems posed by Matet. The first section deals with the existence of stationary subsets of [lambda]^{<kappa} with no unbounded subsets which are not stationary, where, of course, kappa is regular uncountable less or…

We present a review of the most important results in the theory of symmetric functions in superspace (or symmetric superpolynomials), summarizing all principal contributions since its introduction in 2001 in the context of the…

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…

This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…

We extend unbounded Kasparov theory to encompass conformal group and quantum group equivariance. This new framework allows us to treat conformal actions on both manifolds and noncommutative spaces. As examples, we present unbounded…

In this article, using an exemplar-based approach, we investigate the inpainting problem, introducing a new mathematical functional, whose minimization determines the quality of the reconstructions. The new functional expression takes into…

The constraint satisfaction problem (CSP) is a computational problem that includes a range of important problems in computer science. We point out that fundamental concepts of the CSP, such as the solution set of an instance and…

We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…

We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…

We introduce various colouring principles which generalise the so-called "onto mapping principle" of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow to…

The key assumption underlying linear Markov Decision Processes (MDPs) is that the learner has access to a known feature map $\phi(x, a)$ that maps state-action pairs to $d$-dimensional vectors, and that the rewards and transitions are…

In scheduling and timetabling applications, the mutual-exclusion constraint stipulates that certain pairs of tasks that cannot be executed at the same time. This corresponds to the vertex colouring problem in graph theory, for which there…

If supersymmetry is discovered at future colliders, what can we learn? While our appreciation of the variety of possible supersymmetric models has grown tremendously in recent years, most attempts to answer this question have been in the…

In this paper, we prove a new continuous embedding theorem for fractional Sobolev spaces with variable exponents into variable exponent Lebesgue spaces on unbounded domains. As an application, we study a class of nonlocal elliptic problems…