Paper Info
Title
Two mechanisms for generating infinite families of pairing bijections
Abstract
We explore two general mechanisms for producing pairing bijections (bijective functions defined from N2 → N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct pairing bijections. The second mechanism, using characteristic functions of subsets of N provides 2N distinct pairing bijections. Mechanisms to combine such pairing bijections and their application to generate families of permutations of N are also described. The paper uses a small subset of the functional language Haskell to provide executable specifications of various the functions defined in a literate programming style.
Year
DOI
Venue
2013
10.1145/2513228.2513264
RACS
Keywords
Field
DocType
n-adic valuations result,general mechanism,infinite family,distinct pairing bijections,characteristic function,functional language haskell,pairing bijections,bijective function,countable family,literate programming style,executable specification,functional programming,lazy evaluation
Functional programming,Computer science,Haskell,Artificial intelligence,Computer vision,Combinatorics,Countable set,Bijection,Permutation,Lazy evaluation,Algorithm,Pairing,Bijection, injection and surjection
Conference
Citations 
PageRank 
References 
0
0.34
8
Authors
1
Name
Order
Citations
PageRank
Paul Tarau11529113.14