超图上的可识别级数
Recognizable Series on Hypergraphs
摘要:
我们引入了超图加权模型(HWM)的概念,一般将张量网络与超图相关联,然后通过由其超边定向的张量收缩来计算值。定义在超图族上的级数r称为可识别的,如果存在计算它的HWM,这个模型推广了字符串和树上的有理级数的概念。我们证明了模型的一些性质,并研究了在什么条件下有限支撑列是可识别的。
英文摘要:
We introduce the notion of Hypergraph Weighted Model (HWM) that generically associates a tensor network to a hypergraph and then computes a value by tensor contractions directed by its hyperedges. A series r defined on a hypergraph family is said to be recognizable if there exists a HWM that computes it. This model generalizes the notion of rational series on strings and trees. We prove some properties of the model and study at which conditions finite support series are recognizable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。