Affiliation:
1. Department of Mathematics and Computer Science, Allameh Tabataba’i University, Tehran, Iran
Abstract
In this paper, we present a multiset analogue of the even-odd permutations identity in the context of combinatorics of words. The multiset version is indeed equivalent to the coin arrangements lemma which is a key lemma in Sherman’s proof of Feynman’s conjecture about combinatorial solution of Ising model in statistical physics. Here, we give a bijective proof which is based on the standard factorization of a Lyndon word.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献