Generalization of Subadditive, Monotone and Convex Functions
Angshuman R. Goswami

TL;DR
This paper generalizes classical subadditivity to higher orders, introduces approximate and periodic monotonicity concepts, and explores star convexity, providing new insights into the structural properties of these functions.
Contribution
It extends subadditivity to any order, introduces approximate subadditivity and periodic monotonicity, and investigates star convexity and its relation to star convex bodies.
Findings
Higher-order subadditivity implies ordinary subadditivity of roots.
Approximately subadditive functions can be decomposed into subadditive and bounded parts.
Periodically monotone functions can be decomposed into monotone and periodic functions.
Abstract
Let be a non empty and non singleton interval where denotes the set of all non negative numbers. A function is said to be subadditive if for any and , it satisfies the following inequality In this paper, we consider this ordinary notion of subadditivity is of order and generalized the concept for any order , where . We establish that square root of a order subadditive function possesses ordinary subadditivity. We also introduce the notion of approximately subadditive function and showed that it can be decomposed as the algebraic summation of a subadditive and a bounded function. Another important newly introduced concept is Periodical monotonicity. A function is said to be periodically monotone with a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFunctional Equations Stability Results · Mathematical Inequalities and Applications · Mathematics and Applications
