𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms in Local Algebra

✍ Scribed by Hans-Gert Gräbe

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
395 KB
Volume
19
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

Let (k) be a field, (S=k\left[x_{v}: v \in V\right]) be the polynomial ring over the finite set of variables ( (x_{v}: v \in V) ), and (m=\left(x_{v}: v \in V\right)) the ideal defining the origin of Spec S.

It is theoretically known (see e.g. Alonso et al., 1991) that the algorithmic ideas for the computation of ideal (and module) intersections, quotients, deciding radical membership etc. in (S) may be adopted not only for computations in the local ring (S_{m}) but also for term orders of mixed type with standard bases replacing Gröbner bases. Using the generalization of Mora's tangent cone algorithm to arbitrary term orders we give a detailed description of the necessary modifications and restrictions.

In a second part we discuss a generalization of the deformation argument for standard bases and independent sets to term orders of mixed type. For local term orders these questions were investigated in Gräbe (1991).

The main algorithmic ideas described are implemented in the author's REDUCE package CALI (Gräbe , 1993a).

📜 SIMILAR VOLUMES

Local Box Adjacency Algorithms for Cylin
Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions
✍ Scott M c Callum; George E. Collins 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 372 KB

We describe new algorithms for determining the adjacencies between zero-dimensional cells and those one-dimensional cells that are sections (not sectors) in cylindrical algebraic decompositions (cad). Such adjacencies constitute a basis for determining all other cell adjacencies. Our new algorithms

A Probabilistic Algorithm to Test Local
A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time
✍ Alexandre Sedoglavic 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 395 KB

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behaviour of an experiment? How many of the remaining variables should we assume to be known in order to determ

Factorization-free Decomposition Algorit
Factorization-free Decomposition Algorithms in Differential Algebra
✍ Evelyne Hubert 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Insight on the structure of differential ideals defined by coherent autoreduced set allows one to uncouple the differential and algebraic computations in a decomposition algorithm. Original results as well as concise new proofs of already presented theorems are exposed. As a consequence, an effectiv

Algorithms forq -Hypergeometric Summatio
Algorithms forq -Hypergeometric Summation in Computer Algebra
✍ Harald Böing; Wolfram Koepf 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 406 KB

This paper describes three algorithms for q-hypergeometric summation: • a multibasic analogue of Gosper's algorithm, • the q-Zeilberger algorithm, and • an algorithm for finding q-hypergeometric solutions of linear recurrences together with their Maple implementations, which is relevant both to pe

Algebraic algorithms in GF(q)
Algebraic algorithms in GF(q)
✍ J. Calmet 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 568 KB

This talk reports on joint work with R. Loos (Univ. Karlsruhe) on algebraic algorithms for computing in large Galois Fields GF(q) with q = p" where p is the characteristic of the field and may be arbitrarily large. This work is materialized by a module of algorithms implemented in the ALDES/SACZ co