Carlos Zapata-Carratalá , Xerxes D. Arsiwalla , Taliesin Beynon
{"title":"Diagrammatic calculus and generalized associativity for higher-arity tensor operations","authors":"Carlos Zapata-Carratalá , Xerxes D. Arsiwalla , Taliesin Beynon","doi":"10.1016/j.tcs.2024.114915","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper we investigate a ternary generalization of associativity by defining a diagrammatic calculus of hypergraphs that extends the usual notions of tensor networks, categories and relational algebras. Our key insight is to approach higher associativity as a confluence property of hypergraph rewrite systems. In doing so we rediscover the ternary structures known as heaps and are able to give a more comprehensive treatment of their emergence in the context of dagger categories and their generalizations. This approach allows us to define a notion of ternary category and heapoid, where morphisms bind three objects simultaneously, and suggests a systematic study of higher arity forms of associativity.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1020 ","pages":"Article 114915"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005322","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we investigate a ternary generalization of associativity by defining a diagrammatic calculus of hypergraphs that extends the usual notions of tensor networks, categories and relational algebras. Our key insight is to approach higher associativity as a confluence property of hypergraph rewrite systems. In doing so we rediscover the ternary structures known as heaps and are able to give a more comprehensive treatment of their emergence in the context of dagger categories and their generalizations. This approach allows us to define a notion of ternary category and heapoid, where morphisms bind three objects simultaneously, and suggests a systematic study of higher arity forms of associativity.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.