𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for Computing Homology Groups

✍ Scribed by J.R.J. Groves

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
330 KB
Volume
194
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Subexponential Algorithms for Class Grou
Subexponential Algorithms for Class Group and Unit Computations
✍ H. COHEN; F. DIAZ Y DIAZ; M. OLIVIER πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 351 KB

We describe in detail the implementation of an algorithm which computes the class group and the unit group of a general number field, and solves the principal ideal problem. The basic ideas of this algorithm are due to J. Buchmann. New ideas are the use of LLL-reduction of an ideal in a given direct

Equivariant Homology for Totally Disconn
Equivariant Homology for Totally Disconnected Groups
✍ Peter Schneider πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 200 KB

One of the far-reaching problems about continuous group actions is the w x Baum᎐Connes conjecture BCH . Although it is an assertion about certain K-theoretic invariants in the equivariant setting the understanding of the Ž . corresponding equivariant co homological invariants should be most useful.

An Algorithm for Computing an Integral B
An Algorithm for Computing an Integral Basis in an Algebraic Function Field
✍ Mark van Hoeij πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 310 KB

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 a New Normal
An Algorithm for Computing a New Normal Form for Dynamical Systems
✍ Guoting Chen; Jean Della Dora πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 378 KB

We propose in this paper a new normal form for dynamical systems or vector fields which improves the classical normal forms in the sense that it is a further reduction of the classical normal forms. We give an algorithm for an effective computation of these normal forms. Our approach is rational in