Polynomial selections and separation by polynomials
From MaRDI portal
Publication:4890743
set-valued functionsLagrange interpolation polynomialHelly's theorem\(n\)-convex functionaffine functionsselections\(n\)-concave functionseparation by polynomials
Convexity of real functions in one variable, generalizations (26A51) Inequalities involving other types of functions (26D07) Set-valued functions (26E25) Systems of functional equations and inequalities (39B72) Helly-type theorems and geometric transversal theory (52A35) Selections in general topology (54C65)
Abstract: Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex functions of higher order. Another application is some Hyers-Ulam-stability-type result.
Recommendations
Cited in
(10)- Convex separation by regular pairs
- The affine separation problem revisited
- Separation by Jensen and affine stochastic processes
- Separant of an arbitrary polynomial
- Separants of some polynomials
- Convex structures induced by Chebyshev systems
- Generalized convexity and separation theorems
- Strong \(h\)-convexity and separation theorems
- On a separation for the Cauchy equation on spheres
- Convexity without convex combinations
This page was built for publication: Polynomial selections and separation by polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890743)