A Multiset Version of Even-Odd Permutations Identity
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 10 references that are in the map. First posted on arXiv 2 Jun 2022.
Builds on
0 of 10 references.
No references here yet.
Built on by
Not cited yet.