On combinatorial compexity of convex sequences
From MaRDI portal
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.
This page was built for publication: On combinatorial compexity of convex sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473359)
