𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing Ext Algebras for Finite Groups

✍ Scribed by JON F. CARLSON; EDWARD L. GREEN; GERHARD J.A. SCHNIEDER

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
355 KB
Volume
24
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

The Ext-Algebra of a Representation-Fini
The Ext-Algebra of a Representation-Finite Biserial Algebra
✍ Peter Brown πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 157 KB

## Let be a basic representation-finite biserial finite-dimensional k-algebra. We describe a method for constructing a multiplicative basis and the bound quiver of the Ext-algebra E = mβ‰₯0 Ext m /r /r of using the Auslander-Reiten quiver of .

Finite algebras and renormalization grou
Finite algebras and renormalization group equations
✍ Al. Anghel; M. Crisan πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 254 KB

An algebric method of the renormalization group equations is proposed in order to study the field theory with multiple coupling constants for r, =-0. The method is applied to a non abelian gauge theory with two scalar fields.

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

Computing Subgroups by Exhibition in Fin
Computing Subgroups by Exhibition in Finite Solvable Groups
✍ Bettina Eick; Charles R.B Wright πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 316 KB

We present practical algorithms to compute subgroups such as Hall systems, system normalizers, F-normalizers and F-covering subgroups in finite solvable groups. An application is an algorithm to calculate head complements in finite solvable groups; that is, complements which are closely related to m