Related papers: A Convex Stone-Weierstrass Theorem & Applications

In the setting of step two Carnot groups, we show a "cone property" for horizontally convex sets. Namely we prove that, given a horizontally convex set $C$, a pair of points $P\in \partial C$ and $Q\in $ int $C$, both belonging to a…

We will use different way (in this work) from the existing methods in the literature which speaking in the separation of convex sets was carried out by hyperplanes. We are examining the behavior of convex set which is the domain of convex…

Monotone convex operators and time-consistent systems of operators appear naturally in stochastic optimization and mathematical finance in the context of pricing and risk measurement. We study the dual representation of a monotone convex…

Let $C$ be a compact convex subset of $\mathbb{R}^n$, $f:C\to\mathbb{R}$ be a convex function, and $m\in\{1, 2, ..., \infty\}$. Assume that, along with $f$, we are given a family of polynomials satisfying Whitney's extension condition for…

In this paper we study, in the relaxed context of locally convex spaces, intrinsic properties of monotone operators needed for the sum conjecture for maximal monotone operators to hold under classical interiority-type domain constraints.

Given a closed, convex cone $K\subseteq \mathbb{R}^n$, a multivariate polynomial $f\in\mathbb{C}[\mathbf{z}]$ is called $K$-stable if the imaginary parts of its roots are not contained in the relative interior of $K$. If $K$ is the…

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquitous challenge in many areas of science and engineering.…

We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

In this brief note, it is shown that the function p^TW log(p) is convex in p if W is a diagonally dominant positive definite M-matrix. The techniques used to prove convexity are well-known in linear algebra and essentially involves…

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of…

We study algebraic dynamical systems (and, more generally, $\sigma$-varieties) $\Phi:{\mathbb A}^n_{\mathbb C} \to {\mathbb A}^n_{\mathbb C}$ given by coordinatewise univariate polynomials by refining a theorem of Ritt. More precisely, we…

Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and…

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Let $X$ be a separable Banach function space on the unit circle $\mathbb{T}$ and $H[X]$ be the abstract Hardy space built upon $X$. We show that the set of analytic polynomials is dense in $H[X]$ if the Hardy-Littlewood maximal operator is…

Let T and C be two Hilbert space operators. We prove that if T is near, in a certain sense, to an operator completely polynomially dominated with a finite bound by C, then T is similar to an operator which is completely polynomially…

In a recent work of Matteo Mio on compact quantitative equational theories (here compact means that all its consequences are derivable by means of finite proofs) convex algebras on the carrier set [0,1] whose operations are monotone and…

The present paper is concerned with some representatons of linear mappings of continuous functions into locally convex vector spaces, namely: If X is a complete Hausdorff locally convex vector space, then a general form of weakly compact…