A Multiset Version of Even-Odd Permutations Identity

06/02/2022
by   Hossein Teimoori Faal, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2020

A combinatorial conjecture from PAC-Bayesian machine learning

We present a proof of a combinatorial conjecture from the second author'...
research
04/20/2020

Further Evidence Towards the Multiplicative 1-2-3 Conjecture

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kaz...
research
10/20/2022

Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

We study divide-and-conquer recurrences of the form f(n) = α ...
research
11/24/2012

Modeling problems of identity in Little Red Riding Hood

This paper argues that the problem of identity is a critical challenge i...
research
08/02/2020

Extendability of simplicial maps is undecidable

We present a short proof of the Čadek-Krčál-Matoušek-Vokřínek-Wagner res...
research
11/10/2021

Rooted quasi-Stirling permutations of general multisets

Given a general multiset ℳ={1^m_1,2^m_2,…,n^m_n}, where i appears m_i ti...
research
06/12/2018

Is India's Unique Identification Number a legally valid identification?

A legally valid identification document allows impartial arbitration of ...

Please sign up or login with your details

Forgot password? Click here to reset