Rewriting in higher dimensional linear categories and application to the affine oriented Brauer category (Q2411669)

The author introduces a rewriting theory of linear monoidal categories. Rewriting is a model of computing presenting relations between expressions as oriented computation steps. Of course, the author studies linear monoidal categories through their higher version: linear \((n,p)\)-categories. As an application of the theory, the author gives a constructive proof of the basis theorem for walled Brauer algebras which has been proved by \textit{H. Rui} and \textit{Y. Su} [Adv. Math. 285, 28--71 (2015; Zbl 1356.17012)].