HackerPapers

arXiv:1706.04129cs.DM

The Rosenberg-Strong Pairing Function

Matthew P. Szudzik

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
27 pages, 5 figures; citation style and document class updated, other minor changes
Journal reference
DOI
Subjects
cs.DMDiscrete Mathematics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Mar 2024 to Mar 2024.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Gerbil Scheme – A Lisp for the 21st Century 1 comment

    • That’s only true if the list of programming languages is infinite or if the list of features is infinite. If you want the list to be expandable without ever reindexing AND you want it to still be relatively compact, you can use Rosenberg-Strong which creates a square shells…

      steegoView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.