On Holant Theorem and Its Proof
Information Theory
2010-05-11 v1 math.IT
Abstract
Holographic algorithms are a recent breakthrough in computer science and has found applications in information theory. This paper provides a proof to the central component of holographic algorithms, namely, the Holant theorem. Compared with previous works, the proof appears simpler and more direct. Along the proof, we also develop a mathematical tool, which we call c-tensor. We expect the notion of c-tensor may be applicable over a wide range of analysis.
Keywords
Cite
@article{arxiv.1005.1349,
title = {On Holant Theorem and Its Proof},
author = {Ali Al-Bashabsheh and Yongyi Mao and Abbas Yongacoglu},
journal= {arXiv preprint arXiv:1005.1349},
year = {2010}
}
Comments
25th Queen's Biennial Symposium on Communications.