How to count the number of irreducible components of the scheme of finite-dimensional algebra structures (Q788081)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How to count the number of irreducible components of the scheme of finite-dimensional algebra structures |
scientific article |
Statements
How to count the number of irreducible components of the scheme of finite-dimensional algebra structures (English)
0 references
1982
0 references
This paper concerns the problem of counting the number \(a_ n\) of irreducible components of the k-scheme \(A_ n\) of unitary, associative algebra structures on \(k^ n\), where k is an algebraically closed field. And it studies the asymptotic behavior of \(a_ n\) as n tends to infinity. For the purpose the combinatorial growth is defined. The aim of the paper is to show that quiver-algebras obtained from minimal simple quivers dominate the asymptotic behavior of \(a_ n\). The main result is as follows: The combinatorial growth of \(a_ n\) is equal to that of the number of irreducible components of the subscheme of \(A_ n\) of quotient algebra structures of quiver-algebras by ideals generated by the arrows of minimal simple quivers. This result is a generalization of the results of Flanigan concerning prematrix algebras.
0 references
number of irreducible components. Maola, Guerin
0 references
k-scheme
0 references
associative algebra structures
0 references
asymptotic behavior
0 references
combinatorial growth
0 references
quiver- algebras
0 references
minimal simple quivers
0 references