Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 59 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 110 tok/s Pro
Kimi K2 210 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

On uniformly convex functions (2102.03086v3)

Published 5 Feb 2021 in math.FA

Abstract: Non-convex functions that yet satisfy a condition of uniform convexity for non-close points can arise in discrete constructions. We prove that this sort of discrete uniform convexity is inherited by the convex envelope, which is the key to obtain other remarkable properties such as the coercivity. Our techniques allow to retrieve Enflo's uniformly convex renorming of super-reflexive Banach spaces as the regularization of a raw function built from trees. Among other applications, we provide a sharp estimation of the distance of a given function to the set of differences of Lipschitz convex functions. Finally, we prove the equivalence of several natural fashions to quantify the non-super weakly compactness of a subset of a Banach space.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.