Timeline for extensions of the Nekrasov-Okounkov formula
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2021 at 15:47 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 15 characters in body
|
| Feb 22, 2021 at 6:10 | history | edited | Francesco Polizzi | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Feb 22, 2021 at 2:52 | comment | added | Jeanne Scott | Actually that's good news because I am doing the same computation for the Young-Fibonacci lattice and starting for $n=5$ I get some terrible irreducible factor. | |
| Feb 22, 2021 at 2:51 | comment | added | Richard Stanley | For your first question the data is not promising. For $5\leq n\leq 20$ there is exactly one irreducible (over $\mathbb{Q}$) factor of degree $>1$. These degrees are: $(2,3,3,4,3,8,6,9,8,9,12,13,11,13,12,16)$. The degree of the polynomial is $n$. | |
| Feb 22, 2021 at 2:47 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 229 characters in body
|
| Feb 22, 2021 at 2:36 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
further explication about interpolation
|
| Feb 22, 2021 at 2:24 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
interpolaton postscript
|
| Feb 22, 2021 at 2:03 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
post reference added
|
| Feb 22, 2021 at 1:57 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
further elaboration on Nekrasov-Okoukov
|
| Feb 22, 2021 at 1:33 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
deleted 61 characters in body
|
| Feb 22, 2021 at 1:26 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
content identity
|
| Feb 22, 2021 at 1:21 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 37 characters in body
|
| Feb 22, 2021 at 1:14 | history | edited | Jeanne Scott | CC BY-SA 4.0 |
added 37 characters in body
|
| Feb 22, 2021 at 1:09 | history | asked | Jeanne Scott | CC BY-SA 4.0 |