On combinatorial compexity of convex sequences

Simple item page
dc.creatorIosevich, A.
dc.creatorRudnev, M.
dc.creatorTen, V.
dc.date2003-11-18
dc.date.accessioned2026-07-07T05:02:59Z
dc.date.available2026-07-07T05:02:59Z
dc.descriptionWe obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.
dc.identifierhttps://arxiv.org/abs/math/0311297
dc.identifierhttp://arxiv.org/abs/math/0311297
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69234
dc.subjectCombinatorics
dc.subjectClassical Analysis and ODEs
dc.titleOn combinatorial compexity of convex sequences
dc.typetext

Files

Collections

arXiv