Sandwich theorem for reciprocally strongly convex functions

dc.contributor.authorMireya Bracamonte
dc.contributor.authorJosé Ariel Giménez
dc.contributor.authorJesús Medina
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T15:08:09Z
dc.date.available2026-03-22T15:08:09Z
dc.date.issued2018
dc.descriptionCitaciones: 6
dc.description.abstractWe introduce the notion of reciprocally strongly convex functions and we present some examples and properties of them. We also prove that two real functions f and g, defined on a real interval [a, b], satisfy for all x, y ∈ [a, b] and t ∈ [0, 1] iff there exists a reciprocally strongly convex function h : [a, b] → R such that f (x) ≤ h(x) ≤ g(x) for all x ∈ [a, b]. Finally, we obtain an approximate convexity result for reciprocally strongly convex functions; namely we prove a stability result of Hyers-Ulam type for this class of functions.
dc.identifier.doi10.15446/recolma.v52n2.77157
dc.identifier.urihttps://doi.org/10.15446/recolma.v52n2.77157
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/50588
dc.language.isoen
dc.publisherNational University of Colombia
dc.relation.ispartofRevista Colombiana de Matemáticas
dc.sourceEscuela Superior Politecnica del Litoral
dc.subjectConvexity
dc.subjectConvex function
dc.subjectMathematics
dc.subjectRegular polygon
dc.subjectClass (philosophy)
dc.subjectFunction (biology)
dc.subjectPure mathematics
dc.subjectLogarithmically convex function
dc.subjectInterval (graph theory)
dc.subjectCombinatorics
dc.titleSandwich theorem for reciprocally strongly convex functions
dc.typearticle

Files