Timeline for Young-Fibonacci version of Nekrasov-Okounkov
Current License: CC BY-SA 4.0
28 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 5, 2021 at 1:07 | comment | added | Jeanne Scott | @SamHopkins This is not a blog posting. It is, rather, a question (stated in two or three different ways) explained in the scope of a larger problem . And indeed many users take the view that questions which are submitted to MO should provided a context. I'm also aware that there is a fair amount of "spite" down-voting which goes on, as well as an ample dose of condescension. I'll probably be down-voted just for making this remark. | |
| Jul 5, 2021 at 0:09 | comment | added | Sam Hopkins | I did not down vote, but it's worth bearing in mind that many take the view that MO is not and should not be a "blog" style website for sharing mathematical thoughts, and constantly updating your answers to your own question can be seen as too much in that blog style. | |
| Jul 4, 2021 at 19:50 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
replaced $*$ by $\dagger$'s
|
| Mar 14, 2021 at 11:34 | comment | added | Todd Trimble | Please bear in mind that every edit comes at the expense of every other question on MathOverflow, bumping the post to the top and pushing others down the stack. That can't be helped, but please be considerate of others and combine edits as economically as you can. | |
| Mar 14, 2021 at 1:03 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
error with $\varphi(z;t)$ fixed
|
| Mar 14, 2021 at 0:52 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
syntax
|
| Mar 14, 2021 at 0:24 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
fibonacci $t=0$ case added
|
| Mar 14, 2021 at 0:10 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
edited body
|
| Mar 13, 2021 at 23:40 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
deleted 15 characters in body
|
| Mar 13, 2021 at 23:28 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
regauging the ODE and $J$-type continued fraction discussed
|
| Mar 5, 2021 at 21:13 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
minor clarification
|
| Feb 28, 2021 at 23:36 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
reformatting some formulae
|
| Feb 25, 2021 at 4:38 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
deleted 3 characters in body
|
| Feb 24, 2021 at 3:41 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
calculation of $F(z;1)$ refined
|
| Feb 24, 2021 at 1:48 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Feb 24, 2021 at 1:42 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 50 characters in body
|
| Feb 24, 2021 at 1:31 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
appeal that those who know about special functions and continued fractions added
|
| Feb 24, 2021 at 1:19 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 2 characters in body
|
| Feb 23, 2021 at 22:59 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 48 characters in body
|
| Feb 23, 2021 at 22:52 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 48 characters in body
|
| Feb 23, 2021 at 22:21 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
tridiagonal determinantal formula --- simplified
|
| Feb 23, 2021 at 22:13 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
tridiagonal determinantal formula
|
| Feb 23, 2021 at 21:39 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
changed notation to stress that $\Bbb{f}_t(n)$ is a polynomial version of the fibonacci number
|
| Feb 23, 2021 at 21:23 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 10 characters in body
|
| Feb 23, 2021 at 21:06 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
fibonacci generating function error corrected
|
| Feb 23, 2021 at 20:25 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
clearing up some errors with $s=0$.
|
| Feb 23, 2021 at 19:47 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 30 characters in body
|
| Feb 23, 2021 at 19:41 | history | answered | Jeanne Scott | CC BY-SA 4.0 |