SearcharxivSearch

arXiv · 1607.04026

A new characterization of convexity with respect to Chebyshev systems

Abstract

The notion of $n$th order convexity in the sense of Hopf and Popoviciu is defined via the nonnegativity of the $(n+1)$st order divided differences of a given real-valued function. In view of the well-known recursive formula for divided differences, the nonnegativity of $(n+1)$st order divided differences is equivalent to the $(n-k-1)$st order convexity of the $k$th order divided differences which provides a characterization of $n$th order convexity. The aim of this paper is to apply the notion of higher-order divided differences in the context of convexity with respect to Chebyshev systems introduced by Karlin in 1968. Using a determinant identity of Sylvester, we then establish a formula for the generalized divided differences which enables us to obtain a new characterization of convexity with respect to Chebyshev systems. Our result generalizes that of Wąsowicz which was obtained in 2006. As an application, we derive a necessary condition for functions which can be written as the difference of two functions convex with respect to a given Chebyshev system.

Explore related subjects

Keep this discovery

BibTeXRIS

Zsolt Páles, Éva Székelyné Radácsi. 2018-03-17. A new characterization of convexity with respect to Chebyshev systems. https://doi.org/10.7153/jmi-2018-12-46

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA