English
Related papers

Related papers: On the bad points of positive semidefinite polynom…

200 papers

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

Complex Variables · Mathematics 2026-02-25 Greg Knese , James Eldred Pascoe , Alan Sola

A rational homogeneous (of degree one) positive real matrix-valued function is presented as the Schur complement of a block of the linear pencil with positive semidefinite matrix coefficients. The partial derivative numerators of a rational…

Complex Variables · Mathematics 2021-03-04 M. F. Bessmertnyi

With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre

In optimization problems involving smooth functions and real and matrix variables, that contain matrix semidefiniteness constraints, consider the following change of variables: Replace the positive semidefinite matrix $X \in \mathbb{S}^d$,…

Optimization and Control · Mathematics 2025-02-05 Lijun Ding , Stephen J. Wright

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…

Dynamical Systems · Mathematics 2019-08-15 Patrick Ingram

Hyperbolic polynomials are real multivariate polynomials with only real roots along a fixed pencil of lines. Testing whether a given polynomial is hyperbolic is a difficult task in general. We examine different ways of translating…

Algebraic Geometry · Mathematics 2018-10-24 Papri Dey , Daniel Plaumann

Let $g_1,\dots, g_s \in \mathbb{R}[X_1,\dots, X_n,Y]$ and $S = \{(\bar{x},y)\in \mathbb{R}^{n+1} \mid g_1(\bar{x},y) \ge 0, \dots, g_s(\bar{x}, y) \ge 0\}$ be a non-empty, possibly unbounded, subset of a cylinder in $\mathbb{R}^{n+1}$. Let…

Algebraic Geometry · Mathematics 2024-01-09 Gabriela Jeronimo , Daniel Perrucci

Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…

Optimization and Control · Mathematics 2014-02-26 Daniel Plaumann

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…

Symbolic Computation · Computer Science 2018-09-06 Hoon Hong , Thomas Sturm

By a result of Helton and McCullough, open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D_L of a linear matrix inequality (LMI) L(X)>0. This paper gives a precise algebraic certificate for a polynomial…

Functional Analysis · Mathematics 2018-04-27 J. William Helton , Igor Klep , Christopher S. Nelson

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Algebraic Geometry · Mathematics 2008-07-22 Tim Netzer

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek

A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be \emph{immediately renormalizable} if there exists a (connected) quadratic-like invariant filled Julia set $K^*$ such that $b\in K^*$. In that case exactly one…

Dynamical Systems · Mathematics 2021-02-23 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

We study the quantitative relationship between the cones of nonnegative polynomials, cones of sums of squares and cones of sums of powers of linear forms. We derive bounds on the volumes (raised to the power reciprocal to the ambient…

Algebraic Geometry · Mathematics 2007-05-23 Grigoriy Blekherman

We show that the values of a certain family of weakly holomorphic modular functions at points in the divisors of any meromorphic modular form with algebraic Fourier coefficients are algebraic. We use this to extend the classical result of…

Number Theory · Mathematics 2021-07-05 Daeyeol Jeon , Soon-Yi Kang , Chang Heon Kim

This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…

Complex Variables · Mathematics 2020-10-21 Innocent Ndikubwayo

Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…

Operator Algebras · Mathematics 2011-04-19 Igor Klep , Markus Schweighofer

Let $V$ be a vector space over a finite field $k=\mathbb{F} _q$ of dimension $n$. For a polynomial $P:V\to k$ we define the bias of $P$ to be $$b_1(P)=\frac {|\sum _{v\in V}\psi (P(V))|}{q^n}$$ where $\psi :k\to \mathbb{C} ^\star$ is a…

Number Theory · Mathematics 2017-01-10 David Kazhdan , Tamar Ziegler

Assessing non-negativity of multivariate polynomials over the reals, through the computation of {\em certificates of non-negativity}, is a topical issue in polynomial optimization. This is usually tackled through the computation of {\em…

Symbolic Computation · Computer Science 2021-07-27 Victor Magron , Mohab Safey El Din , Trung-Hieu Vu
‹ Prev 1 4 5 6 7 8 10 Next ›