Timeline for The growth of maximum elements for the reflection group $D_n$
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2019 at 15:35 | comment | added | Nathan Reading | I haven't thought this through to the end, but perhaps there is an argument based on writing the Poincare polynomials in terms of the degrees. It is certainly easy to write a recursion giving the actual polynomials. From there, maybe one can see how largest coefficients behave under the recursion. Have you tried that? UPDATE: Based on the OEIS sequence you reference, I'm now guessing you've already thought about this. | |
| Jul 23, 2019 at 6:43 | comment | added | Martin Rubey | This is now findstat.org/St001443. | |
| Jul 23, 2019 at 4:44 | history | edited | Mikhail Gaichenkov | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jul 22, 2019 at 20:06 | history | edited | Mikhail Gaichenkov |
edited tags
|
|
| Jul 22, 2019 at 20:00 | history | edited | Mikhail Gaichenkov | CC BY-SA 4.0 |
added 2 characters in body
|
| Jul 22, 2019 at 19:55 | history | asked | Mikhail Gaichenkov | CC BY-SA 4.0 |