𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial Algorithms in Computer Algebra

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
105 KB
Volume
79
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Algorithms in Local Algebra
Algorithms in Local Algebra
✍ Hans-Gert GrΓ€be πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 395 KB

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

An Algorithm for Computing Graded Algebr
An Algorithm for Computing Graded Algebras
✍ Michael Vaughan-Lee πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 391 KB

In this article I describe an algorithm for computing finite dimensional graded algebras, and I describe an implementation of the algorithm. As an application of the algorithm, I investigate associative algebras satisfying the identity \(x^{4}=0\). I show that if \(A\) is an associative algebra over

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