2000 character limit reached
A Multiset Version of Even-Odd Permutations Identity (2206.01291v1)
Published 2 Jun 2022 in math.CO and cs.CL
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.