A Multiset Version of Even-Odd Permutations Identity

arXiv2206.01291MaRDI QIDQ6506010FDOQ6506010

Authors: Hossein Teimoori Faal 

Abstract: 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.

This page was built for publication: A Multiset Version of Even-Odd Permutations Identity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506010)