Timeline for A simplified version of an old problem about the generating function for unrestricted partitions
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2017 at 21:06 | comment | added | David S. Newman | I've now read the revised version of the answer by Aaron Meyerowitz and checked one of the largest degree maximal polynomials. This case of my old problem seems to be solved. Does anyone think they can solve the next case? By this I mean: start with the generating function for unrestricted partitions as above and change signs in the first two expressions in parentheses of the product. Can the new series have coefficients all of which are 1, -1, and zero? This is much harder. | |
| Jun 25, 2017 at 20:59 | comment | added | David S. Newman | I've now read the revised version of the answer by Aaron Meyerowitz and checked one of the largest degree maximal polynomials. This case of my old problem seems to be solved. Does anyone think they can solve the next case. By this I mean: s | |
| Jun 25, 2017 at 20:55 | vote | accept | David S. Newman | ||
| Jun 24, 2017 at 22:47 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 419 characters in body
|
| Jun 24, 2017 at 21:34 | comment | added | David S. Newman | I'm glad to see that the branch that you've chosen here is in agreement with what I've calculated. It is impossible to continue this branch to 25. What you are indicating with the c's and d I do not understand. All that would be necessary to do is continue the same sort of calculations for all the other branches. I think I have accomplished this but it would be nice to have independent confirmation. Otherwise I'll just do the computations again by myself. | |
| Jun 24, 2017 at 8:30 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |