On combinatorial compexity of convex sequences
arXiv:math/0311297
Abstract
We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.
arXiv:math/0311297
We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.