2000 character limit reached
On Symmetric Invertible Binary Pairing Functions (2105.10752v1)
Published 22 May 2021 in math.CO and cs.DM
Abstract: We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of symmetric invertible binary pairing functions on any custom set of integers could be seen.