✦ LIBER ✦

Computing Toric Ideals

✍ Scribed by A.M. Bigatti; R. La Scala; L. Robbiano

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 478 KB
Volume: 27
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1998.0256

No coin nor oath required. For personal study only.

✦ Synopsis

Toric ideals are binomial ideals which represent the algebraic relations of sets of power products. They appear in many problems arising from different branches of mathematics. In this paper, we develop new theories which allow us to devise a parallel algorithm and an efficient elimination algorithm. In many respects they improve existing algorithms for the computation of toric ideals.

📜 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

Computing Ideals of Points

✍ J. Abbott; A. Bigatti; M. Kreuzer; L. Robbiano 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 337 KB

We address the problem of computing ideals of polynomials which vanish at a finite set of points. In particular we develop a modular Buchberger-Möller algorithm, best suited for the computation over Q, and study its complexity; then we describe a variant for the computation of ideals of projective p

Using Galois Ideals for Computing Relati

Using Galois Ideals for Computing Relative Resolvents

✍ Philippe Aubry; Annick Valibouze 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 340 KB

In this paper we show that some ideals which occur in Galois theory are generated by triangular sets of polynomials. This geometric property seems important for the development of symbolic methods in Galois theory. It may and should be exploited in order to obtain more efficient algorithms, and it e

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

Ideal Class Groups, Some Computations

✍ R.I. Berger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 401 KB

Starting from a base ficld with properties similar to those of the rational numbers, the structure of the ideal class group of a biquadratic dicyclic extension is examined. Class number relations and structural connections between the ideal class groups of the intermediate fields allow the determina

Algorithm for Computing Bernstein–Sato I

Algorithm for Computing Bernstein–Sato Ideals Associated with a Polynomial Mapping

✍ Rouchdi Bahloul 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Let f 1 , . . . , fp be polynomials in n variables with coefficients in a field K. We associate with these polynomials a number of functional equations and related ideals B, B j and B Σ of K[s 1 , . . . , sp] called Bernstein-Sato ideals. Using standard basis techniques, our aim is to present an alg