English
Related papers

Related papers: Stable normal forms for polynomial system solving

200 papers

When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form…

Commutative Algebra · Mathematics 2010-12-07 David Eisenbud , Bernd Ulrich

An ideal $I$ in a Noetherian ring is called \textit{normal} if $I^n$ is integrally closed for all $n \geq 1$. Zariski proved that in two-dimensional regular local rings, every integrally closed ideal is normal. However, in dimension three…

Commutative Algebra · Mathematics 2026-02-03 Maki Ataka , Naoyuki Matsuoka

Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…

Commutative Algebra · Mathematics 2024-09-20 Chenqi Mou , Qiuye Song

The purpose of this paper is to initiate a new attack on Arveson's resistant conjecture, that all graded submodules of the $d$-shift Hilbert module $H^2$ are essentially normal. We introduce the stable division property for modules (and…

Operator Algebras · Mathematics 2011-04-26 Orr Shalit

We show that any nonzero polynomial in the ideal generated by the $r \times r$ minors of an $n \times n$ matrix $X$ can be used to efficiently approximate the determinant. For any nonzero polynomial $f$ in this ideal, we construct a small…

Computational Complexity · Computer Science 2022-10-28 Robert Andrews , Michael A. Forbes

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

Dynamical Systems · Mathematics 2025-03-17 Ziyad AlSharawi , Jose S. Cánovas , Sadok Kallel

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

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

Commutative Algebra · Mathematics 2009-10-16 Juergen Herzog , Takayuki Hibi , Freyja Hreinsdottir , Thomas Kahle , Johannes Rauh

Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$ and $I \subset S$ a homogeneous ideal of $S$ with $\dim S/I = d$. The Hilbert series of $S/I$ is of the form…

Commutative Algebra · Mathematics 2017-11-07 Takayuki Hibi , Kazunori Matsuda

The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…

Commutative Algebra · Mathematics 2016-02-26 Winfried Bruns , Aldo Conca

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

Symbolic Computation · Computer Science 2026-05-12 Kosuke Sakata , Tsuyoshi Takagi

We propose a general study of standard bases of polynomial ideals with parameters in the case where the monomial order is arbitrary. We give an application to the computation of the stratification by the local Hilbert-Samuel function.…

Algebraic Geometry · Mathematics 2010-04-07 Rouchdi Bahloul

The problem of stability of the triangular libration points in the planar circular restricted three-body problem is considered. A software package, intended for normalization of autonomous Hamiltonian systems by means of computer algebra,…

Earth and Planetary Astrophysics · Physics 2013-12-30 I. I. Shevchenko

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

Commutative Algebra · Mathematics 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze…

Symbolic Computation · Computer Science 2024-06-10 Mariya Bessonov , Ilia Ilmer , Tatiana Konstantinova , Alexey Ovchinnikov , Gleb Pogudin , Pedro Soto

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

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

Symbolic Computation · Computer Science 2015-06-09 Sajjad Rahmany , Abdolali Basiri , Benyamin M. -Alizadeh

We study (slope-)stability properties of syzygy bundles on a projective space P^N given by ideal generators of a homogeneous primary ideal. In particular we give a combinatorial criterion for a monomial ideal to have a semistable syzygy…

Algebraic Geometry · Mathematics 2007-08-01 Holger Brenner

Nowadays, many strategies to solve polynomial systems use the computation of a Gr{\"o}bner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gr{\"o}bner basis for the…

Symbolic Computation · Computer Science 2016-02-03 Guénaël Renault , Tristan Vaccon

We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…

Rings and Algebras · Mathematics 2013-11-20 Fernando Szechtman