Related papers: Sharp values for the constants in the polynomial B…

We derive sharp, explicit constants in inverse trace inequalities for polynomial functions belonging to $\mathbb{P}_p(T)$ (polynomial space with total degree $p$) that are orthogonal to the lower-order subspace $\mathbb{P}_n(T)$, $n\leq p$,…

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…

This paper establishes a sharp Schwarz-Pick type inequality for real-valued invariant harmonic functions defined on the complex unit ball $\mathbb B^n$. The proof of this main result simultaneously provides a solution to a natural extension…

A homogeneous polynomial S(x_1, ..., x_n) of degree r in n variables posesses a discriminant D_{n|r}(S), which vanishes if and only if the system of equations dS/dx_i = 0 has non-trivial solutions. We give an explicit formula for…

The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…

Let $p$ be a homogeneous polynomial of degree $n$ in $n$ variables, $p(z_1,...,z_n) = p(Z)$, $Z \in C^{n}$. We call such a polynomial $p$ {\bf H-Stable} if $p(z_1,...,z_n) \neq 0$ provided the real parts $Re(z_i) > 0, 1 \leq i \leq n$. This…

The following theorem is proved. {\bf Theorem.} {\it Let $P(x) = \sum_{k=0}^{2n} a_k x^k$ be a polynomial with positive coefficients. If the inequalities $\frac{a_{2k+1}^2}{a_{2k}a_{2k+ 2}} < \frac{1}{cos^2(\frac{\pi}{n+2})} $ hold for all…

In this paper, we establish hardness and approximation results for various $L_p$-ball constrained homogeneous polynomial optimization problems, where $p \in [2,\infty]$. Specifically, we prove that for any given $d \ge 3$ and $p \in…

We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…

In this paper, we proved that any 2-convex solution $u$ of $\sigma_2(D^2u)=1$ with a quadratic growth must be a quadratic polynomial in $\mathbb{R}^n\ (n\geq 3 )$ by using a Pogorelov estimate and the global gradient estimate. And we give a…

We investigate the growth of the constants of the polynomial Hardy-Littlewood inequality.

Given a set of inequalities determined by homogeneous forms, the following intertwined results are established: (1) the volume of the real semi-algebraic domain determined by these inequalities is explicitly determined; it is shown to be…

We characterize all the multiple orthogonal threefold symmetric polynomial sequences whose sequence of derivatives is also multiple orthogonal. Such a property is commonly called the Hahn property and it is an extension of the concept of…

We follow a polynomial approach to analyse strong stability of linear difference equations with rationally independent delays. Upon application of the Hermite stability criterion on the discrete-time homogeneous characteristic polynomial,…

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

We study stability issues for the so-called Borell-Brascamp-Lieb inequalities, proving that when near equality is realized, the involved functions must be $L^1$-close to be $p$-concave and to coincide up to homotheties of their graphs.

Orthogonal polynomials on the unit circle are completely determined by their reflection coefficients through the Szeg\H{o} recurrences. We assume that the reflection coefficients converge to some complex number a with 0 < |a| < 1. The…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

We provide explicit conditions for a real polynomial $f$ of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of $f$, i.e. with no lifting. All conditions are simple and provide an explicit description of a…