A generalization of the brauer algebra
William Y.C. Chen, Christian M. Reidys

TL;DR
This paper explores two new algebraic structures extending the Brauer algebra, analyzing their semisimplicity properties and providing a broader understanding of their algebraic behavior.
Contribution
It introduces the algebras A_n(x) and L_n(x) as generalizations of the Brauer algebra and studies their semisimplicity conditions.
Findings
A_n(x) is semisimple if x is not an integer.
L_n(x) is semisimple if x is nonzero.
The paper extends previous work on partition and Brauer algebras.
Abstract
We study two variations of the Brauer algebra . The first is the algebra , which generalizes the Brauer algebra by considering loops. The second is the algebra , the -subalgebra generated by diagrams without horizontal arcs. and have for an hereditary-chain indexed by all integers. Following the ideas of Martin in the context of the partition algebra, and Doran et al. for the Brauer algebra, we study semisimplicity of using restriction and induction in and . Our main result is that is semisimple if and that is semisimple if .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Topics in Algebra
