On combinatorial compexity of convex sequences
classification
🧮 math.CO
math.CA
keywords
convexsequencesarisingboundcombinatorialcompexitydiophantineequation
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.