In this paper, we give a new bijective proof of a multiset analogue of even-odd permutations identity. This multiset version is equivalent to the original coin arrangements lemma which is a key combinatorial lemma in the Sherman's Proof of a conjecture of Feynman about an identity on paths in planar graphs related to combinatorial solution of two dimensional Ising model in statistical physics.

翻译：在本文中,我们给出了一个新的两面性证据, 以证明偶差变异特征的多组类比。 这个多组化版本相当于原始硬币安排 lemma, 也就是谢尔曼对Feynman关于与统计物理中两个维Is 模型的组合式解析方法有关的平面图路径上身份的推测中的关键组合式灵敏度。