Timeline for Representing a number close to 1 with a sum of reciprocals of natural numbers
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2014 at 6:19 | comment | added | Jeremy Kahn | Whether or not it's a good thing, I've added a separate answer in answer to @NoamD.Elkies' question. | |
| Sep 21, 2014 at 6:17 | history | edited | Jeremy Kahn |
edited tags
|
|
| Sep 21, 2014 at 6:14 | answer | added | Jeremy Kahn | timeline score: 4 | |
| Sep 19, 2014 at 23:16 | comment | added | Gerhard Paseman | Since your question is short, adding about twice as much ink after the question to explain motivation is welcome. If it gets to ten times as much ink, consider abbreviating the motivation and providing a link to an expanded version. I don't see adding a separate answer for it yet as a good thing. Gerhard "Or Measure It In Pixels" Paseman, 2014.09.19 | |
| Sep 19, 2014 at 18:48 | comment | added | Lee Mosher | @JeremyKahn: I vote a partial yes for more details, insofar as your comment does not yet address how Egyptian fractions are relevant to Thurston's iteration. | |
| Sep 19, 2014 at 18:17 | comment | added | Jeremy Kahn | Meta question: should I provide a more detailed answer to @NoamD.Elkies's in my question, or in an answer to the question? | |
| Sep 19, 2014 at 18:16 | comment | added | Jeremy Kahn | @NoamD.Elkies: Thurston (see the paper by Douady and Hubbard) defined an iteration on Teichmuller space that finds the (usually unique) rational map that is dynamically equivalent to a given postcritically finite branched cover. An invariant system of curves for the branched cover gives rise to a matrix with nonnegative entries: if the leading eigenvalue of the matrix is at least 1, then there is no rational map, and if the leading eigenvalue is close to and less than 1, then the iteration takes a long time to converge to the rational map. | |
| Sep 19, 2014 at 18:09 | comment | added | Jeremy Kahn | @PietroMajer: yes. | |
| Sep 19, 2014 at 17:51 | vote | accept | Jeremy Kahn | ||
| Sep 17, 2014 at 5:26 | comment | added | Pietro Majer | In the definition of $H$, the maximum is taken over $k$-ples of any length $k$, right? | |
| Sep 17, 2014 at 4:59 | answer | added | Noam D. Elkies | timeline score: 19 | |
| Sep 16, 2014 at 5:16 | comment | added | Noam D. Elkies | Neat question. How does this arise in your research (if it does)? And how far have you computed past $N=5$? | |
| Sep 16, 2014 at 0:46 | answer | added | Bill Mance | timeline score: 1 | |
| Sep 15, 2014 at 2:57 | answer | added | Igor Rivin | timeline score: 2 | |
| Sep 15, 2014 at 2:53 | history | asked | Jeremy Kahn | CC BY-SA 3.0 |