Article ID Journal Published Year Pages File Type
4656435 Journal of Combinatorial Theory, Series A 2006 5 Pages PDF
Abstract

In [H. Rui, A criterion on the semisimple Brauer algebras, J. Combin. Theory Ser. A 111 (2005) 78–88], the first author gave an algorithm for determining the pairs (n,δ) such that the Brauer algebra Bn(δ) over a field F is semisimple. Such an algorithm involves a subset Z(n)⊂Z. In this note, we give an explicit description about Z(n). Using [H. Rui, A criterion on the semisimple Brauer algebras, J. Combin. Theory Ser. A 111 (2005) 78–88, 1.3] we verify Enyang's conjecture given in [J. Enyang, Specht modules and semisimplicity criteria for Brauer and Birman–Murakami–Wenzl algebras, preprint, 2005, 12.2].

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics