Trees and Brauer trees (Q2639865): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ravi N. Kalia / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ravi N. Kalia / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3807410 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90228-a / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2062437727 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:51, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trees and Brauer trees |
scientific article |
Statements
Trees and Brauer trees (English)
0 references
1990
0 references
The Brauer tree is a graph which is a tree together with a planar embedding and a selected vertex, called the exceptional vertex, to which is attached a positive integer called the multiplicity. The Brauer trees have applications to the theory of blocks with cyclic defect occurring in the representation theory of finite groups. The object of the paper is to establish a theorem which runs as: If the multiplicities of the vertices of T are \(m_ 1,m_ 2,...,m_ e\), where the tree T has e edges and \(e+1\) vertices, then the determinant of the Cartan matrix C is \(\sum^{C}_{1}m_ 1m_ 2...\hat m_ i...m_ e\). The caret on \(m_ i\) denotes omission of the factor under t.
0 references
Brauer trees
0 references
Cartan matrix
0 references