A Multiset Version of Even-Odd Permutations Identity
Combinatorics
2022-06-06 v1 Computation and Language
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.
Keywords
Cite
@article{arxiv.2206.01291,
title = {A Multiset Version of Even-Odd Permutations Identity},
author = {Hossein Teimoori Faal},
journal= {arXiv preprint arXiv:2206.01291},
year = {2022}
}