### A characterization of the orthogonal polynomials.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Converging sequences in metric space have Hausdorff dimension zero, but their metric dimension (limit capacity, entropy dimension, box-counting dimension, Hausdorff dimension, Kolmogorov dimension, Minkowski dimension, Bouligand dimension, respectively) can be positive. Dimensions of such sequences are calculated using a different approach for each type. In this paper, a rather simple formula for (lower, upper) metric dimension of any sequence given by a differentiable convex function, is derived....

The least concave majorant, $\widehat{F}$, of a continuous function $F$ on a closed interval, $I$, is defined by $$\widehat{F}\left(x\right)=inf\{G\left(x\right):G\ge F,\phantom{\rule{4pt}{0ex}}G\phantom{\rule{4.0pt}{0ex}}\text{concave}\},\phantom{\rule{1.0em}{0ex}}x\in I.$$ We present an algorithm, in the spirit of the Jarvis March, to approximate the least concave majorant of a differentiable piecewise polynomial function of degree at most three on $I$. Given any function $F\in {\mathcal{C}}^{4}\left(I\right)$, it can be well-approximated on $I$ by a clamped cubic spline $S$. We show that $\widehat{S}$ is then a good approximation to $\widehat{F}$. We give two examples, one to illustrate, the other to apply our algorithm.