Integer Complexity: Experimental and Analytical Results II

@inproceedings{Cernenoks2015IntegerCE,
  title={Integer Complexity: Experimental and Analytical Results II},
  author={Juris Cernenoks and Janis Iraids and Martins Opmanis and Rihards Opmanis and Karlis Podnieks},
  booktitle={DCFS},
  year={2015}
}
  • Juris Cernenoks, Janis Iraids, +2 authors Karlis Podnieks
  • Published in DCFS 2015
  • Computer Science, Mathematics
  • We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- is defined as the number of ones in the shortest expressions representing n. We arrive here very soon at the problems that are easy to formulate, but (it seems) extremely hard to solve. In this paper we represent our attempts to explore the field by means of experimental mathematics. Having computed the values of ||n… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES
    Numbers with Integer Complexity Close to the Lower Bound
    12
    Integer Complexity, Addition Chains, and Well-Ordering.
    2
    Algorithms for determining integer complexity
    10
    "How many $1$'s are needed?" revisited
    6
    Maximal Independent Sets and Separating Covers
    7
    The On-Line Encyclopedia of Integer Sequences
    4537
    Automatic Sequences - Theory, Applications, Generalizations
    580
    Integer Complexity and Well-Ordering
    8