Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > History and Overview

arXiv:1801.01360 (math)
[Submitted on 2 Jan 2018]

Title:Minimal Representations of Natural Numbers Under a Set of Operators

Authors:Akshunna Shaurya Dogra
View PDF
Abstract:This paper studies the minimal length representation of the natural numbers. Let O be a fixed set of integer-valued functions (primarily hyperoperations). For each n, what is the shortest way of expressing n as a combinations of functions in O to the constant 1? For example, if O contains the two functions Sx (successor of x) and *xy (x times y) then the shortest representation of 12 is *SSS1SS1, with 8 symbols. This is taken to mean that 8 is complexity of 12 under O. We make a study of such minimal representations and complexities in this paper, proving and/or rightly predicting bounds on complexities, discussing some relevant patterns in the complexities and minimal representations of the natural numbers and listing the results gleaned from computational analysis. Computationally, the first 4.5 million natural numbers were probed to verify our mathematically obtained results. Due to the finiteness of the problem, we used the method of exhaustion of possibilities to state some other results as well.
Comments: 13 pages, 2 figures, 2 tables
Subjects: History and Overview (math.HO)
Cite as: arXiv:1801.01360 [math.HO]
  (or arXiv:1801.01360v1 [math.HO] for this version)
  https://doi.org/10.48550/arXiv.1801.01360

Submission history

From: Akshunna Dogra [view email]
[v1] Tue, 2 Jan 2018 13:34:47 UTC (61 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.HO
< prev   |   next >
new | recent | 2018-01
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)