Timeline for Representing numbers in a non-integer base with few (but possibly negative) nonzero digits
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Oct 22, 2014 at 16:13 | comment | added | Ira Gessel | Alpert's theorem was proved earlier by Clemens Heuberger, "Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms", Periodica Mathematica Hungarica 49 (2), 2004, 65–89. | |
| Mar 13, 2011 at 17:57 | comment | added | Zsbán Ambrus | The original claim allows repeating a Fibonacci number multiple times. Can you still apply this result that way? | |
| Jan 17, 2010 at 18:25 | comment | added | Kevin O'Bryant | It's definitely the author I had in mind, but I heard the result stated in a survey talk (speaker to remain unnamed!). | |
| Jan 17, 2010 at 2:37 | comment | added | Michael Lugo | I suspect the answer to your question 2 is no; it seems like the number of digits one needs should grow like the logarithm of the number you're trying to represent. | |
| Jan 17, 2010 at 2:25 | comment | added | aorq | Thanks, Michael! It seems quite likely this is the paper in question. I think this settles the validity of the claim/proof, and so now my question #2 remains. | |
| Jan 17, 2010 at 2:12 | history | answered | Michael Lugo | CC BY-SA 2.5 |