Combinatorics and algebra of tensor calculus
classification
🧮 math.CT
keywords
tensorcalculusnaturealgebraalgebraiccategoriescharacterizescoarse-graining
read the original abstract
In this paper, motivated by the theory of operads and PROPs we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and characterizes the algebraic nature of tensor calculus.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.