Algorithms for computing integral bases of an algebraic function field are implemented in some computer algebra systems. They are used e.g. for the integration of algebraic functions. The method used by Maple 5.2 and AXIOM is given by Trager in [Trager,1984]. He adapted an algorithm of Ford and Zass
An Algorithm for Computing Graded Algebras
β Scribed by Michael Vaughan-Lee
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 391 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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 field of characteristic zero, and if (a^{4}=0) for all (a \in A), then (A^{10}={0}),
π SIMILAR VOLUMES
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
Suppose that G is a finite group and k is a field of characteristic p > 0. In this paper we describe a scheme for computing the Ext algebra of kG, i.e. the algebra Ext \* kg (T, T ) where T is the sum of irreducible kG-modules.