Determination of socle series using the condensation method (Q5928887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 00:25, 30 January 2024

scientific article; zbMATH DE number 1584490
Language Label Description Also known as
English
Determination of socle series using the condensation method
scientific article; zbMATH DE number 1584490

    Statements

    Determination of socle series using the condensation method (English)
    0 references
    0 references
    0 references
    12 December 2001
    0 references
    The authors present a new algorithm for the calculation of the socle series of an \(A\)-module \(V\) where \(A\) is a finite dimensional associative algebra over a field \(F\). The new algorithm relies on the peakword method introduced by \textit{K. Lux, J. Müller} and \textit{M. Ringe} [J. Symb. Comput. 17, No. 6, 529-544 (1994; Zbl 0828.16001)]. The condensation method has become a standard tool to reduce the dimension of the \(A\)-modules to be investigated, and thus is also applied in the context of the present paper. Hence, for a suitable idempotent \(e\in A\) the \(eAe\)-module \(Ve\) becomes the object of interest. But then one has to solve the problem of finding a generating set of \(eAe\). The authors deal with this in the special case \(A=FG\) for a finite group \(G\) and prove an algorithmic criterion which guarantees that a set of elements in \(e_HFGe_H\) generates \(e_HFGe_H\) where \(e_H\) is an idempotent of the form \(e_H=(\sum_{h\in H}h)/|H|\) with a subgroup \(H\) of \(G\) of order coprime to \(|F|\). In order to demonstrate the power of the new method the authors determine the previously unknown socle series of the projective indecomposable modules of the sporadic simple group \(M_{23}\) in characteristic \(2\).
    0 references
    socle series
    0 references
    condensation method
    0 references
    projective indecomposable modules
    0 references
    algorithms
    0 references
    generating sets
    0 references
    finite groups
    0 references
    idempotents
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references