具有不变性的简单复数上的张量分解

IF 0.6 4区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Symbolic Computation Pub Date : 2024-01-19 DOI:10.1016/j.jsc.2024.102299
Gemma De las Cuevas , Matt Hoogsteder Riera , Tim Netzer
{"title":"具有不变性的简单复数上的张量分解","authors":"Gemma De las Cuevas ,&nbsp;Matt Hoogsteder Riera ,&nbsp;Tim Netzer","doi":"10.1016/j.jsc.2024.102299","DOIUrl":null,"url":null,"abstract":"<div><p><span>Tensors are ubiquitous in mathematics and the sciences, as they allow to store information in a concise way. Decompositions of tensors may give insights into their structure and complexity. In this work, we develop a new framework for decompositions of tensors, taking into account invariance, positivity and a geometric arrangement of their local spaces. We define an invariant decomposition with indices arranged on a simplicial complex which is explicitly invariant under a group action. We give a constructive proof that this decomposition exists for all invariant tensors, after possibly enriching the simplicial complex. We further define several decompositions certifying positivity, and prove similar existence results, as well as inequalities between the corresponding ranks. Our results generalize results from the theory of </span>tensor networks, used in the study of quantum many-body systems, for example.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tensor decompositions on simplicial complexes with invariance\",\"authors\":\"Gemma De las Cuevas ,&nbsp;Matt Hoogsteder Riera ,&nbsp;Tim Netzer\",\"doi\":\"10.1016/j.jsc.2024.102299\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>Tensors are ubiquitous in mathematics and the sciences, as they allow to store information in a concise way. Decompositions of tensors may give insights into their structure and complexity. In this work, we develop a new framework for decompositions of tensors, taking into account invariance, positivity and a geometric arrangement of their local spaces. We define an invariant decomposition with indices arranged on a simplicial complex which is explicitly invariant under a group action. We give a constructive proof that this decomposition exists for all invariant tensors, after possibly enriching the simplicial complex. We further define several decompositions certifying positivity, and prove similar existence results, as well as inequalities between the corresponding ranks. Our results generalize results from the theory of </span>tensor networks, used in the study of quantum many-body systems, for example.</p></div>\",\"PeriodicalId\":50031,\"journal\":{\"name\":\"Journal of Symbolic Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-01-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Symbolic Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0747717124000038\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124000038","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

张量在数学和科学中无处不在,因为它们能以简洁的方式存储信息。对张量进行分解可以深入了解它们的结构和复杂性。在这项工作中,我们开发了一种新的张量分解框架,其中考虑到了其局部空间的不变性、实在性和几何排列。我们定义了一种不变分解,其指数排列在单纯复数上,在群作用下具有显式不变性。我们给出了一个构造性证明,即在可能丰富简单复数之后,所有不变张量都存在这种分解。我们进一步定义了几种证明实在性的分解,并证明了类似的存在性结果,以及相应等级之间的不等式。我们的结果概括了张量网络理论的结果,例如用于量子多体系统的研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Tensor decompositions on simplicial complexes with invariance

Tensors are ubiquitous in mathematics and the sciences, as they allow to store information in a concise way. Decompositions of tensors may give insights into their structure and complexity. In this work, we develop a new framework for decompositions of tensors, taking into account invariance, positivity and a geometric arrangement of their local spaces. We define an invariant decomposition with indices arranged on a simplicial complex which is explicitly invariant under a group action. We give a constructive proof that this decomposition exists for all invariant tensors, after possibly enriching the simplicial complex. We further define several decompositions certifying positivity, and prove similar existence results, as well as inequalities between the corresponding ranks. Our results generalize results from the theory of tensor networks, used in the study of quantum many-body systems, for example.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
142 days
期刊介绍: An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.
期刊最新文献
Persistent components in Canny's generalized characteristic polynomial Coupled cluster degree of the Grassmannian Mixed volumes of networks with binomial steady-states Creative telescoping for hypergeometric double sums On nonnegative invariant quartics in type A
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1