2013/01/01 by Paul Tarau, Tarau, Paul
Computer Science · #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Mathematical Software (cs.MS) #Programming Languages (cs.PL) #cs.DM #cs.DS #cs.MS #cs.PL
paper · pdf · doi:10.48550/arxiv.1301.0114
UNPUBLISHED DRAFT, 26 pages, 2 figures, literate Haskell code included
arxiv created 2013/01/01 · arxiv updated 2013/01/03
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional bitstring representations? While answering these questions positively, our tree based representation described in this paper comes with a few extra benefits: it compresses giant numbers such that, for instance, the largest known prime number as well as its related perfect number are represented as trees of small sizes. The same also applies to Fermat numbers and important computations like exponentiation of two become constant time operations. At the same time, succinct representations of sparse sets, multisets and sequences become possible through bijections to our tree-represented natural numbers.