Preprint in the OpenAI Math release
Midpoint convexity from bounded tree potentials and path costs
OpenAI
Abstract
Four real Banach spaces defined by bounded tree potentials satisfy the averaged asymptotic midpoint bound for , while none admits an asymptotically uniformly convex (AUC) renorming. On finite-height trees, the globally constrained norm equals the least additive cost of a Hilbert vector and root paths. The quadratic path and segment-start outer Hilbert sums are reflexive and asymptotically midpoint uniformly convex, and admit no equivalent AUC norm.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.