Timeline for Young-Fibonacci version of Nekrasov-Okounkov
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2021 at 18:38 | comment | added | Jeanne Scott | Clearly the trick should be the write down and solve the $1$-st order ODE for $\tilde{E}_k(x) := {1 \over {(1-x)}} \, E_k(x)$ where $E_k(x) := \sum_{n \geq 0} \, \langle E_k \rangle_n \, x^n$. | |
| Feb 28, 2021 at 0:53 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
deleted 3 characters in body
|
| Feb 28, 2021 at 0:42 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
deleted 27 characters in body
|
| Feb 28, 2021 at 0:14 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
fixed the recursion error(s)
|
| Feb 27, 2021 at 2:22 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
edited body
|
| Feb 27, 2021 at 2:11 | history | answered | Jeanne Scott | CC BY-SA 4.0 |