Total Positivity and Convexity Preservation
β Scribed by Michael S. Floater
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 196 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we define convexity and rational convexity preservation of systems of functions and we show that total positivity and rational convexity preservation are equivalent. We also characterize certain convexity preserving systems in terms of weak Tchebycheff systems. Curve intersections and curvatures of Be zier curves are also studied.
π SIMILAR VOLUMES
## Abstract A total dominating function (TDF) of a graph __G__ = (__V, E__) is a function __f__: __V__ β [0, 1] such that for each __v__ Ο΅ V, Ξ£~uΟ΅N(v)~ f(u) β₯ 1 (where __N__(__v__) denotes the set of neighbors of vertex __v__). Convex combinations of TDFs are also TDFs. However, convex combinations
## Abstract Working within Bishopβstyle constructive mathematics, we examine some of the consequences of the antiβSpecker property, known to be equivalent to a version of Brouwer's fan theorem. The work is a contribution to constructive reverse mathematics (Β© 2010 WILEYβVCH Verlag GmbH & Co. KGaA,
A total dominating function (TDF) of a graph G = (V, E) is a function f : V β [0, 1] such that for each v β V , the sum of f values over the open neighbourhood of v is at least one. Zero-one valued TDFs are precisely the characteristic functions of total dominating sets of G. We study the convexity
Part 2 contains five chapters, the first four of which are in parallel with the four chapters of part 1 (even with the same titles), but in the multivariate setting. The fifth chapter in part 2 deals with summability for the two-variable case using a method of Marcinkiewicz type. Several aspects of