English
Related papers

Related papers: A Real Nullstellensatz for Matrices of Non-Commuta…

200 papers

We survey a few strengthenings and generalizations of the Combinatorial Nullstellensatz of Alon and the Schwartz-Zippel Lemma. These lemmas guarantee the existence of (a certain number of) nonzeros of a multivariate polynomial when the…

Combinatorics · Mathematics 2023-05-19 Günter Rote

We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints,…

Combinatorics · Mathematics 2014-02-28 Edinah K. Gnang

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

Optimization and Control · Mathematics 2022-10-07 Vanni Noferini , Paul Van Dooren

Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have a common zero in an algebraically closed field. Associated…

Computational Complexity · Computer Science 2024-10-22 Rida Ait El Manssour , Nikhil Balaji , Klara Nosan , Mahsa Shirmohammadi , James Worrell

We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…

Algebraic Geometry · Mathematics 2019-07-02 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

This paper establishes new Positivstellens\"atze for polynomials that are positive on sets defined by polynomial matrix inequalities (PMIs). We extend the classical Handelman and Krivine-Stengle theorems from the scalar inequality setting…

Optimization and Control · Mathematics 2025-09-03 Feng Guo

Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…

General Mathematics · Mathematics 2024-08-23 Petar P. Petrov

We derive some Positivstellensatz\"e for noncommutative rational expressions from the Positivstellensatz\"e for noncommutative polynomials. Specifically, we show that if a noncommutative rational expression is positive on a polynomially…

Functional Analysis · Mathematics 2017-03-22 J. E. Pascoe

Let $k$ be a field with characteristic zero, $R$ be the ring $k[x_1, \cdots, x_n]$ and $I$ be a monomial ideal of $R$. We study the Artinian local algebra $R/I$ when considered as an $R$-module $M$. We show that the largest reduced…

Commutative Algebra · Mathematics 2023-07-14 Tilahun Abebaw , Nega Arega , Teklemichael Worku Bihonegn , David Ssevviiri

In this paper we present a procedure for computing the rational sum of the Hilbert series of a finitely generated monomial right module $N$ over the free associative algebra $K\langle x_1,\ldots,x_n \rangle$. We show that such procedure…

Rings and Algebras · Mathematics 2016-05-30 Roberto La Scala

The all Rota-Baxter algebra structures on the polynomial algebra $R={\bf k}[x]$ are well known. We study the finite dimensional modules of polynomial Rota-Baxter algebras $(\bfk[x],P)$ or $(x {\bf k} [x],P)$ of weight nonzero since some…

Representation Theory · Mathematics 2020-03-13 Xiaomin Tang

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

Logic · Mathematics 2024-06-04 Dhruv Kulshreshtha

Given a monic linear pencil L in g variables let D_L be its positivity domain, i.e., the set of all g-tuples X of symmetric matrices of all sizes making L(X) positive semidefinite. Because L is a monic linear pencil, D_L is convex with…

Rings and Algebras · Mathematics 2018-04-27 J. William Helton , Igor Klep , Scott McCullough

This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of…

Optimization and Control · Mathematics 2025-09-10 Igor Klep , Victor Magron , Gaël Massé , Jurij Volčič

The present paper continues our foundational work on real algebra with preordered commutative semifields and semirings. We prove two abstract Vergleichsstellens\"atze for preordered commutative semirings of polynomial growth. These…

Commutative Algebra · Mathematics 2026-02-25 Tobias Fritz

We present new generalizations of Olson's theorem and of a consequence of Alon's Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime…

Combinatorics · Mathematics 2014-02-19 László Varga

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

In this paper, we consider interpolation by \textit{completely monotonous} polynomials (CMPs for short), that is, polynomials with non-negative real coefficients. In particular, given a finite set $S\subset \mathbb{R}_{>0} \times…

Numerical Analysis · Mathematics 2024-11-05 Katsuyuki Bando , Eitetsu Ken , Hirotaka Onuki

Putinar's Positivstellensatz is a central theorem in real algebraic geometry. It states the following: If you have a set $S= \{ x \in R^n \ | \ g_1 (x) \geq 0, ... , g_m(x) \geq 0\}$ described by some real polynomials $g_i$, then every real…

Algebraic Geometry · Mathematics 2016-03-23 Tom-Lukas Kriel

We show that constant-depth Frege systems with counting axioms modulo $m$ polynomially simulate Nullstellensatz refutations modulo $m$. Central to this is a new definition of reducibility from formulas to systems of polynomials with the…

Computational Complexity · Computer Science 2007-05-23 Russell Impagliazzo , Nathan Segerlind