Emulating primality with multiset representations of natural numbers

Authors:
Paul Tarau
Affiliations:
Department of Computer Science and Engineering, University of North Texas, Denton, Texas
Venue:
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Year:
2011

Citing 10
Cited 0

Generating binary trees by transpositions

Journal of Algorithms
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On Simple Goedel Numberings and Translations

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Riemann's Hypothesis and tests for primality

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On the Additive Theory of Prime Numbers

Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell

Proceedings of the 2009 ACM symposium on Applied Computing
A Groupoid of Isomorphic Data Transformations

Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
An embedded declarative data transformation language

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Declarative modeling of finite mathematics

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
The average amount of information lost in multiplication

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Factorization results in multisets of primes and this mapping can be turned into a bijection between multisets of natural numbers and natural numbers. At the same time, simpler and more efficient bijections exist that share some interesting properties with the bijection derived from factorization. This paper describes mechanisms to emulate properties of prime numbers through isomorphisms connecting them to computationally simpler representations involving bijections from natural numbers to multisets of natural numbers. As a result, interesting automorphisms of N and emulations of the rad, Möbius and Mertens functions emerge in the world of our much simpler multiset representations. The paper is organized as a self-contained literate Haskell program. The code extracted from the paper is available as a standalone program at http://logic.cse.unt.edu/tarau/research/2011/mprimes.hs.