𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals

✍ Scribed by Ignacio Ojeda MartÍnez de Castilla; Ramón Peidra Sánchez

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
359 KB
Volume
30
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Toric Ideals Generated by Quadratic Bino
Toric Ideals Generated by Quadratic Binomials
✍ Hidefumi Ohsugi; Takayuki Hibi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 157 KB

A combinatorial criterion for the toric ideal arising from a finite graph to be generated by quadratic binomials is studied. Such a criterion guarantees that every Koszul algebra generated by squarefree quadratic monomials is normal. We present an example of a normal non-Koszul squarefree semigroup

Primary Decomposition of Lattice Basis I
Primary Decomposition of Lattice Basis Ideals
✍ Serkan Hoşten; Jay Shapiro 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We study the primary decomposition of lattice basis ideals. These ideals are binomial ideals with generators given by the elements of a basis of a saturated integer lattice. We show that the minimal primes of such an ideal are completely determined by the sign pattern of the basis elements, while th

Computing the Primary Decomposition of Z
Computing the Primary Decomposition of Zero-dimensional Ideals
✍ Chris Monico 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let K be an infinite perfect computable field and let I ⊆ K[x] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. In practice

Parametric Decomposition of Monomial Ide
Parametric Decomposition of Monomial Ideals, II
✍ William Heinzer; Ahmad Mirbagheri; L.J. Ratliff Jr.; Kishor Shah 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 324 KB

monomial idea so I is generated by elements of the form x иии x , where each 1 d . Ž . e is a nonnegative integer . The main results of this paper: a establish a practical i Ž . formula which computes the monomial length of I when Rad I s ŽŽ . . Ž . Rad x , . . . , x R ; b determine necessary and su

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 404 KB

It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper

Unmixed-dimensional Decomposition of a F
Unmixed-dimensional Decomposition of a Finitely Generated Perfect Differential Ideal
✍ Driss Bouziane; Abdelilah Kandri Rody; Hamid Maârouf 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We present an algorithm that computes an unmixed-dimensional decomposition of a finitely generated perfect differential ideal I. Each I i in the decomposition I = I 1 ∩ • • • ∩ I k is given by its characteristic set. This decomposition is a generalization of the differential case of Kalkbrener's dec