𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of group algebra computations

✍ Scribed by M.D. Atkinson

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
624 KB
Volume
5
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing in the Field of Complex Algebr
Computing in the Field of Complex Algebraic Numbers
✍ ADAM WOJCIECH STRZEBOΕƒSKI πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 371 KB

In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e

Computing Ext Algebras for Finite Groups
Computing Ext Algebras for Finite Groups
✍ JON F. CARLSON; EDWARD L. GREEN; GERHARD J.A. SCHNIEDER πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 355 KB

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.