Skip to main content
6 events
when toggle format what by license comment
Sep 12, 2014 at 11:56 vote accept Per Alexandersson
Jan 31, 2014 at 15:38 comment added Per Alexandersson You are welcome. Now, when I read the paper by Nathanson and Ruzsa, they define something which is called "height" of a point in $\mathbb{N}^d$, which is just the sum of the coordinates. They use this in an essential way, and the problem I am looking at has a nice property related to this. Maybe that can explain why I get polynomials for those...
Jan 31, 2014 at 14:36 comment added Lucia Thanks for the reference to Nathanson and Ruzsa, which I hadn't seen before.
Jan 31, 2014 at 14:27 comment added Per Alexandersson Ah, thank you, this put me into a nice track. I found a proof of eventual polynomiality here: www.emis.de/journals/JTNB/2002-2/NathansonRuzsa.ps‎. I have to read a bit more, but most results only give polynomiality for n large.
Jan 31, 2014 at 11:57 history edited Lucia CC BY-SA 3.0
added 78 characters in body
Jan 31, 2014 at 11:47 history answered Lucia CC BY-SA 3.0