The Rosenberg-Strong Pairing Function
Discrete Mathematics
2019-01-30 v5
Abstract
This article surveys the known results (and not very well-known results) associated with Cantor's pairing function and the Rosenberg-Strong pairing function, including their inverses, their generalizations to higher dimensions, and a discussion of a few of the advantages of the Rosenberg-Strong pairing function over Cantor's pairing function in practical applications. In particular, an application to the problem of enumerating full binary trees is discussed.
Keywords
Cite
@article{arxiv.1706.04129,
title = {The Rosenberg-Strong Pairing Function},
author = {Matthew P. Szudzik},
journal= {arXiv preprint arXiv:1706.04129},
year = {2019}
}
Comments
27 pages, 5 figures; citation style and document class updated, other minor changes