On combinatorial compexity of convex sequences

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

Keywords

Combinatorics, Classical Analysis and ODEs

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/69234

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0311297
 http://arxiv.org/abs/math/0311297

Collections

arXiv