English
Related papers

Related papers: A Convex Stone-Weierstrass Theorem & Applications

200 papers

We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…

Functional Analysis · Mathematics 2015-07-31 Nathan S. Feldman , Paul McGuire

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

We give a Hahn-Banach Characterization for convex-cyclicity. We also obtain an example of a bounded linear operator $S$ on a Banach space with $\sigma_{p}(S^*)=\emptyset$ such that $S$ is convex-cyclic, but $S$ is not weakly hypercyclic and…

Functional Analysis · Mathematics 2014-10-20 T. Bermúdez , A. Bonilla , N. Feldman

A bounded linear operator $T$ on a Banach space $X$ is called a convex-cyclic operator if there exists a vector $x \in X$ such that the convex hull of $Orb(T, x)$ is dense in $X$. In this paper, for given an aperiodic element $g$ in a…

Functional Analysis · Mathematics 2022-11-04 M. R. Azimi , I. Akbarbaglu , M. Asadipour

By the celebrated Weierstrass Theorem the set of algebraic polynomials is dense in the space of continuous functions on a compact set in R^d. In this paper we study the following question: does the density hold if we approximate only by…

Classical Analysis and ODEs · Mathematics 2007-05-23 David Benko , Andras Kroo

Let $E$ be a Banach space and $\X$ be the closed unit ball of the dual space $E^*$. For a compact set $K$ in $E$, we prove that $K$ is polynomially convex in $E$ if and only if there exist a unital commutative Banach algebra $A$ and a…

Functional Analysis · Mathematics 2017-05-19 Mortaza Abtahi , Sara Farhangi

Integral representations for continuous polynomial local functionals on convex functions are established in terms of a finite family of polynomials. This result is obtained by approximation from a classification of the dense subspace of…

Functional Analysis · Mathematics 2026-04-28 Jonas Knoerr

Let $\Rx$ denote the ring of polynomials in $g$ freely non-commuting variables $x=(x_1,...,x_g)$. There is a natural involution * on $\Rx$ determined by $x_j^*=x_j$ and $(pq)^*=q^* p^*$ and a free polynomial $p\in\Rx$ is symmetric if it is…

Functional Analysis · Mathematics 2012-08-20 Sriram Balasubramanian , Scott McCullough

We investigate structural properties of the cone of roots of relative Steiner polynomials of convex bodies. We prove that they are closed, monotonous with respect to the dimension, and that they cover the whole upper half-plane, except the…

Metric Geometry · Mathematics 2011-12-21 Martin Henk , María A. Hernández Cifre , Eugenia Saorín

We provide some conditions for the graph of a Hoelder-continuous function on \bar{D}, where \bar{D} is a closed disc in the complex plane, to be polynomially convex. Almost all sufficient conditions known to date --- provided the function…

Complex Variables · Mathematics 2015-08-28 Gautam Bharali

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…

Optimization and Control · Mathematics 2012-09-19 Amir Ali Ahmadi , Pablo A. Parrilo

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

Functional Analysis · Mathematics 2017-06-21 Harry Dym , J. William Helton , Scott McCullough

Let $K$ be a compact subset of a totally-real manifold $M$, where $M$ is either a $\mathcal{C}^2$-smooth graph in $\mathbb{C}^{2n}$ over $\mathbb{C}^n$, or $M=u^{-1}\{0\}$ for a $\mathcal{C}^2$-smooth submersion $u$ from $\mathbb{C}^n$ to…

Complex Variables · Mathematics 2015-04-28 Sushil Gorai

We present a hierarchy of semidefinite programs (SDPs) for the problem of fitting a shape-constrained (multivariate) polynomial to noisy evaluations of an unknown shape-constrained function. These shape constraints include convexity or…

Optimization and Control · Mathematics 2022-10-31 Mihaela Curmei , Georgina Hall

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

Optimization and Control · Mathematics 2012-03-20 Timm Oertel , Christian Wagner , Robert Weismantel

Polynomial spaces associated to a convex body $C$ in $({\bf R}^+)^d$ have been the object of recent studies. In this work, we consider polynomial spaces associated to non-convex $C$. We develop some basic pluripotential theory including…

Complex Variables · Mathematics 2021-04-09 N. Levenberg , F. Wielonsky

The g-convexity of functions on manifolds is a generalization of the convexity of functions on Rn. It plays an essential role in both differential geometry and non-convex optimization theory. This paper is concerned with g-convex smooth…

Differential Geometry · Mathematics 2024-09-24 Yu Wang , Ke Ye

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

Complex Variables · Mathematics 2022-10-14 Golam Mostafa Mondal

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

Number Theory · Mathematics 2020-08-28 Andreas Decker , Pieter Moree

Given a finite set $V$, a convexity $\mathscr{C}$, is a collection of subsets of $V$ that contains both the empty set and the set $V$ and is closed under intersections. The elements of $\mathscr{C}$ are called convex sets. The digital…

Combinatorics · Mathematics 2020-08-07 MacKenzie Carr , Christina M. Mynhardt , Ortrud R. Oellermann
‹ Prev 1 2 3 10 Next ›