相关论文: Approximating a norm by a polynomial

This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…

We show that for every non-negative integer d, there exist differential equations w''+Pw=0, where P is a polynomial of degree d, such that some non-trivial solution w has all zeros real.

We study some properties convex functions fulfill. Among the conclusions we obtain from such result, we are able to prove some nontrivial inequalities among real numbers, and we give an improvement of the reverse triangle inequality in the…

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…

In the paper a theorem of Piccard's type is proved and, consequently, the continuity of $\mathcal{D}$-measurable polynomial functions of $n$-th order as well as $\mathcal{D}$-measurable $n$-convex functions is shown. The paper refers to the…

We prove that a generic homogeneous polynomial of degree $d$ is determined, up to a nonzero constant multiplicative factor, by the vector space spanned by its partial derivatives of order $k$ whenever $k\leq\frac{d}{2}-1$.

In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the…

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Let K be a closed bounded convex subset of $\Bbb R^n$; then by a result of the first author, which extends a classical theorem of Whitney there is a constant $w_m(K)$ so that for every continuous function f on K there is a polynomial $\phi$…

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

In this paper, among other things, we show that, given $r\in N$, there is a constant $c=c(r)$ such that if $f\in C^r[-1,1]$ is convex, then there is a number ${\mathcal N}={\mathcal N}(f,r)$, depending on $f$ and $r$, such that for…

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

We consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure…

For $n=0,1,2,\ldots$ let $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k}$. In this paper we illustrate the connection between $\{d_n^{(r)}(x)\}$ and Meixner polynomials. New formulas and recurrence relations for $d_n^{(r)}(x)$ are…

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree $n$ on a bounded convex domain $D$. That is, we study…

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…