English
Related papers

Related papers: Positivity of continuous piecewise polynomials

200 papers

Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…

Algebraic Geometry · Mathematics 2017-05-15 Wojciech Kucharz

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

We introduce an S.o.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite inequality. Our approach involves utilizing a penalty function framework to directly…

Optimization and Control · Mathematics 2025-10-20 Hoang Anh Tran , Kim-Chuan Toh

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó

A non-negativity certificate (NNC) is a way to write a polynomial so that its non-negativity on a semialgebraic set becomes evident. Positivstellens\"atze (Ps\"atze) guarantee the existence of NNCs. Both, NNCs and Ps\"atze underlie powerful…

Optimization and Control · Mathematics 2024-03-25 Olga Kuryatnikova , Juan C. Vera , Luis F. Zuluaga

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Optimization and Control · Mathematics 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…

Rings and Algebras · Mathematics 2021-06-03 Igor Klep , James Eldred Pascoe , Jurij Volčič

For a 4th order 3-dimensional symmetric tensor with its some entries $1$ or $-1$, we show the analytic sufficient and necessary conditions of its positive definiteness. By applying these conclusions, several strict inequalities is bulit for…

Classical Analysis and ODEs · Mathematics 2024-08-27 Yisheng Song

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

Algebraic Geometry · Mathematics 2013-05-07 Pinaki Mondal , Tim Netzer

It is proved that each of compact linear groups of one special type admits a semialgebraic continuous factorization map onto a real vector space.

Algebraic Geometry · Mathematics 2015-01-13 O. G. Styrt

Fractional powers and polynomial maps preserving structured totally positive matrices, one-sided Polya frequency functions, or totally positive kernels are treated from a unifying perspective. Besides the stark rigidity of the polynomial…

Functional Analysis · Mathematics 2022-08-19 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov

The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and…

Combinatorics · Mathematics 2021-04-06 Jie Wang

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

Numerical Analysis · Computer Science 2008-09-05 Deepak Ponvel Chermakani

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Algebraic Geometry · Mathematics 2008-04-15 Gennadiy Averkov

The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…

Commutative Algebra · Mathematics 2026-03-03 Sara Kališnik , Davorin Lešnik

Let $\mathcal{M}$ be a von Neumann algebra with a normal semifinite faithful trace $\tau$. We prove that every continuous $m$-homogeneous polynomial $P$ from $L^p(\mathcal{M},\tau)$, with $0<p<\infty$, into each topological linear space $X$…

Operator Algebras · Mathematics 2019-03-26 J. Alaminos , M. L. C. Godoy , A. R. Villena

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

Commutative Algebra · Mathematics 2011-06-09 Peter M. Johnson

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

Differential Geometry · Mathematics 2010-11-16 François Fillastre