Integer Complexity, Addition Chains, and Well-Ordering.
dc.contributor.author | Altman, Harry J. | en_US |
dc.date.accessioned | 2014-10-13T18:20:31Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2014-10-13T18:20:31Z | |
dc.date.issued | 2014 | en_US |
dc.date.submitted | en_US | |
dc.identifier.uri | https://hdl.handle.net/2027.42/108986 | |
dc.description.abstract | In this dissertation we consider two notions of the "complexity" of a natural number, one being addition chain length, the other known as "integer complexity". The integer complexity of n, denoted ||n||, is the smallest number of 1's needed to write n using an arbitrary combination of addition and multiplication. It is known that n>=3log_3(n) for all n. We consider the difference delta(n):=||n||−3log_3(n), which we call the defect of n. We consider the set of all defects - the set D:={delta(n) : n>=1}. We show that, as a set of real numbers, D is well-ordered, with order type omega^omega; we also show the same for several variants of D. Moreover, we show that, for k>=1 a natural number, the intersection of D with [0, k) has order type omega^k. We also use the defect to prove stabilization results about ||n||. Specifically, for any n, there exists K=K(n) such that for k>=K, we have delta(3^k*n)=delta(3^K*n). We call K(n) the stabilization length of n. Finally, we provide a way of, given r>0, computing all numbers n with delta(n)<r. We use this to show that K(n) is effectively computable. The algorithm is also, empirically, much faster than existing methods for computing ||2^k||, and we use it to prove that ||2^k*3^l||=2k+3l for 0<=k<=48 and l>=0 with k+l>0. In parallel to our results for integer complexity, we also consider addition chain length. An addition chain for n is a sequence (a_0,a_1,...,a_r) such that a_0=1, a_r=n, and, for any k with 1<=k<=r, there exist 0<=i,j<=k such that a_k=a_i+a_j; the number r is the length of the chain. The shortest length among addition chains for n, the addition chain length of n, is denoted l(n). The number l(n) is always at least log_2(n). We consider the difference delta^l(n):=l(n)-log_2(n), which we call the addition-chain defect of n, and the set of all addition-chain defects D^l := {delta^l(n) : n>=1}. We show that D is also a well-ordered set with order type omega^omega. We also use the defect to prove stabilization results about l(n); specifically, for any n, there exists K'=K'(n) such that for k>=K', we have delta^l(2^k*n)=delta^l(2^K'*n). | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Integer Complexity | en_US |
dc.subject | Addition Chains | en_US |
dc.subject | Well-ordering | en_US |
dc.subject | Number Theory | en_US |
dc.subject | Computational Complexity | en_US |
dc.subject | Algorithms | en_US |
dc.title | Integer Complexity, Addition Chains, and Well-Ordering. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Mathematics | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Lagarias, Jeffrey C. | en_US |
dc.contributor.committeemember | Compton, Kevin J. | en_US |
dc.contributor.committeemember | Barvinok, Alexandre I. | en_US |
dc.contributor.committeemember | Strauss, Martin J. | en_US |
dc.contributor.committeemember | Blass, Andreas R. | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/108986/1/haltman_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.