Related papers: Almost optimal polynomial approximation on convex …

We show that $C^0$-fine approximation of convex functions by smooth (or real analytic) convex functions on $\R^d$ is possible in general if and only if $d=1$. Nevertheless, for $d\geq 2$ we give a characterization of the class of convex…

This paper is devoted to the study of the relatively compact sets in Quasi-Banach function spaces, providing an important improvement of the known results. As an application, we take the final step in establishing a relative compactness…

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

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…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…

Let $A(K)$ be the algebra of continuous functions on a compact set $K\subset\mathbb C$ which are analytic on the interior of $K$, and $R(K)$ the closure (with the uniform convergence on $K$) of the functions that are analytic on a…

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

We study the dynamics of polynomial mappings f:C^k to C^k of degree at least 2 that extend continuously to projective space P^k. Our approach is to study the dynamics near the hyperplane at infinity and then making a descent to K --- the…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output. The polynomials are given via lists of their…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…

Let {X_n} be a sequence of analytic sets converging to some analytic set X in the sense of holomorphic chains. We introduce a condition which implies that every irreducible component of X is the limit of a sequence of irreducible components…

We show that there exists a $q$-convex function in a neighborhood of a compact set $K$ in a complex manifold $\mathcal{M}$ if and only if the $q$-nucleus of this compact set is empty. The latter can be characterized as the maximal…

In this paper we generalize to a certain class of Stein manifolds the Bernstein-Walsh-Siciak theorem which describes the equivalence between possible holomorphic continuation of a function $f$ defined on a compact set $K$ in $\mathbb{C}^N$…

Let $X$ be an analytic subset of $U\times C^n$ of pure dimension $k$ such that the projection of $X$ onto $U$ is a proper mapping, where $U$ is a Runge domain in $C^k$. We show that $X$ can be approximated by algebraic sets.

This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…

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…

Suppose that a continuous on the real axis $2\pi$-periodic function $f$ changes its convexity at $2s,\ s\in\Bbb N,$ points $y_i$ on each period: $-\pi\le y_{2s}<y_{2s-1}<...<y_1<\pi,$ and for the rest $i\in\Bbb Z,$ the points $y_i$ are…