Diagrammatic calculus and generalized associativity for higher-arity tensor operations

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Carlos Zapata-Carratalá , Xerxes D. Arsiwalla , Taliesin Beynon
{"title":"Diagrammatic calculus and generalized associativity for higher-arity tensor operations","authors":"Carlos Zapata-Carratalá ,&nbsp;Xerxes D. Arsiwalla ,&nbsp;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.
图解微积分和高次张量运算的广义关联性
在本文中,我们研究了关联性的三元概括,定义了超图的图解微积分,扩展了张量网络、范畴和关系代数的通常概念。我们的主要见解是将高关联性作为超图重写系统的汇合属性来处理。这样,我们就重新发现了被称为堆的三元结构,并能在匕首范畴及其泛化的背景下更全面地处理它们的出现。通过这种方法,我们可以定义三元范畴和堆的概念,其中态同时绑定三个对象,并建议对关联性的更高层次形式进行系统研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信