Combinatorics and algebra of tensor calculus

Sen Hu; Xuexing Lu; Yu Ye

REVIEW

Combinatorics and algebra of tensor calculus

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1501.01790 v1 pith:IR7P4BN6 submitted 2015-01-08 math.CT

Combinatorics and algebra of tensor calculus

Sen Hu , Xuexing Lu , Yu Ye This is my paper

classification math.CT

keywords tensorcalculusnaturealgebraalgebraiccategoriescharacterizescoarse-graining

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

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.

Combinatorics and algebra of tensor calculus

discussion (0)