English
Related papers

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

200 papers

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

Optimization and Control · Mathematics 2024-12-30 Lei Huang

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

Optimization and Control · Mathematics 2023-01-24 Ngoc Hoang Anh Mai

In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…

Algebraic Geometry · Mathematics 2012-01-12 Jairo Bochi , Nicolas Gourmelon

Let $K$ be a field, and let $R = K[X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $K$. Let ${\mathfrak S}_{X}$ be the symmetric group of $X$. The group ${\mathfrak S}_{X}$ acts naturally on $R$, and this in…

Commutative Algebra · Mathematics 2007-05-23 Christopher J. Hillar , Troels Windfeldt

A subspace of an algebra with involution is called a Lie skew-ideal if it is closed under Lie products with skew-symmetric elements. Lie skew-ideals are classified in central simple algebras with involution (there are eight of them for…

Rings and Algebras · Mathematics 2018-04-27 Matej Bresar , Igor Klep

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

Rings and Algebras · Mathematics 2018-08-09 Konrad Schrempf

Let $\mathbf{X} \subseteq \mathbb{R}^n$ be a closed set, and consider the problem of computing the minimum $f_{\min}$ of a polynomial $f$ on $\mathbf{X}$. Given a measure $\mu$ supported on $\mathbf{X}$, Lasserre (SIAM J. Optim. 21(3),…

Optimization and Control · Mathematics 2024-08-19 Lucas Slot , Manuel Wiedmer

In this paper, using some conditions that arise naturally in Alon's combinatorial Nullstellensatz as well as its various extensions and generalizations, we characterize Gr\"{o}bner bases consisting of monic polynomials, which helps us to…

Combinatorics · Mathematics 2023-04-18 Yang Xu , Haibin Kan , Guangyue Han

The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…

Logic in Computer Science · Computer Science 2019-03-08 Thomas Powell , Peter M Schuster , Franziskus Wiesnet

We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over $\Z$. The result improves previous work of Philippon, Berenstein-Yger and Krick-Pardo. We also present degree and height estimates of…

Algebraic Geometry · Mathematics 2007-05-23 Teresa Krick , Luis Miguel Pardo , Martin Sombra

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…

Combinatorics · Mathematics 2016-07-19 Bart Sevenster , Jacob Turner

We prove a general version of Bezout's form of the Nullstellensatz for arbitrary fields. The corresponding sufficient and necessary condition only involves the local existence of multi-valued roots for each of the polynomials belonging to…

Algebraic Geometry · Mathematics 2017-08-16 Juan D. Velez , Danny A. J. Gomez-Ramirez , Edisson Gallego

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

Probability · Mathematics 2018-05-21 Nicholas A. Cook

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 study the vanishing sets of slice regular polynomials in several quaternionic variables. We obtain a geometric description of the vanishing sets in two variables, which leads to a new version of the Strong Hilbert Nullstellensatz in the…

Complex Variables · Mathematics 2023-11-10 Anna Gori , Giulia Sarfatti , Fabio Vlacci

P\'olya's Positivstellensatz and Handelman's Positivstellensatz are known to be concrete instances of the abstract Archimedean Representation Theorem for (commutative unital) rings. We generalise the Archimedean Representation Theorem to…

Algebraic Geometry · Mathematics 2023-11-07 Colin Tan

In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…

Commutative Algebra · Mathematics 2008-07-21 Michael Kunte

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

Data Structures and Algorithms · Computer Science 2016-11-15 Damian Straszak , Nisheeth K. Vishnoi

Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of $|f(A,B)|$ for finite subsets $A$, $B$ of a field, and polynomial $f(x,y)$ of the form $f(x,y)=g(x)+yh(x)$, where degree of $g$ is greater then degree…

Combinatorics · Mathematics 2013-09-17 Fedor Petrov
‹ Prev 1 3 4 5 6 7 10 Next ›