On combinatorial compexity of convex sequences
组合数学
2007-05-23 v1 经典分析与常微分方程
摘要
We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.
引用
@article{arxiv.math/0311297,
title = {On combinatorial compexity of convex sequences},
author = {A. Iosevich and M. Rudnev and V. Ten},
journal= {arXiv preprint arXiv:math/0311297},
year = {2007}
}