arXiv · math/9912035
A Convex Maximization Problem: Discrete Case
Abstract
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with interesting patterns arise in the analysis, owing to the number theoretic origin of the problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Steven Finch. 1999-12-05. A Convex Maximization Problem: Discrete Case. https://searcharxiv.com/abs/math/9912035
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.