Trees and Brauer trees (Q2639865): Difference between revisions

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.