Skip to main content
David S. Newman's user avatar
David S. Newman's user avatar
David S. Newman's user avatar
David S. Newman
  • Member for 11 years, 3 months
  • Last seen more than 3 years ago
comment
Questions about a product of trinomials
@GjergjiZaimi Will similar arguments work if f(n) is taken to be 1+x^n+x^2n+x^3n+...+x^kn . ?
comment
Questions about a product of trinomials
@Fedor Petrov I've made a correction in response to your comment , but I'm not sure if it answers your question.
revised
Loading…
awarded
asked
Loading…
revised
A Mathematica program to output planar partitions
I tried to clarify what I mean by planar partition as was suggested by the first answer to my question.
Loading…
Loading…
comment
Yet another question about unrestricted partitions
@MaxAlekseyev Thanks for the code. Unfortunately I've been unable to follow it thusfar, perhaps because I'm unfamiliar with Pari. I've been using Mathematica only for the last several years.
comment
Yet another question about unrestricted partitions
@MaxAlekseyev Thank you for this. How long did your search for the maximal series take? Could you provide me with the program? Your solution with degree 121 is better than I ever found. The next logical thing to try by way of a search is to write 1/(1-x^2) as 1+x^2+x^4+...before changing the signs.
Loading…
asked
Loading…
comment
A simplified version of an old problem about the generating function for unrestricted partitions
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.
comment
A simplified version of an old problem about the generating function for unrestricted partitions
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
comment
A simplified version of an old problem about the generating function for unrestricted partitions
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.
comment
A simplified version of an old problem about the generating function for unrestricted partitions
@Alexey Ustinov I just noticed that when you edited the problem you left off the ellipsis in the term that begins 1+x^3+x^6+x^9. There should be a "+..." there.
comment
A simplified version of an old problem about the generating function for unrestricted partitions
@Alexey Ustinov. Ultimately, my motivation for this problem came from a comparison of the generating function for partitions into distinct parts (1+x)(1+x^2)(1+x^3)... with the series (1-x)(1-x^2)(1-x^3)...=1-x-x^2+x^5+x^7-x^12-... I wanted to find other instances where a change of sign led to some pretty result.
Loading…
Loading…
1 2
3
4 5
7