2 results
Search Results
Now showing 1 - 2 of 2
Article Citation - WoS: 8Citation - Scopus: 10The Norm Estimates for The q-bernstein Operator in The Case q > 1(Amer Mathematical Soc, 2010) Wang, Heping; Ostrovska, SofiyaThe q-Bernstein basis with 0 < q < 1 emerges as an extension of the Bernstein basis corresponding to a stochastic process generalizing Bernoulli trials forming a totally positive system on [0, 1]. In the case q > 1, the behavior of the q-Bernstein basic polynomials on [0, 1] combines the fast increase in magnitude with sign oscillations. This seriously complicates the study of q-Bernstein polynomials in the case of q > 1. The aim of this paper is to present norm estimates in C[0, 1] for the q-Bernstein basic polynomials and the q-Bernstein operator B-n,B-q in the case q > 1. While for 0 < q <= 1, parallel to B-n,B-q parallel to = 1 for all n is an element of N, in the case q > 1, the norm parallel to B-n,B-q parallel to increases rather rapidly as n -> infinity. We prove here that parallel to B-n,B-q parallel to similar to C(q)q(n(n-1)/2)/n, n -> infinity with C-q = 2 (q(-2); q(-2))(infinity)/e. Such a fast growth of norms provides an explanation for the unpredictable behavior of q-Bernstein polynomials (q > 1) with respect to convergence.Article Citation - WoS: 2Citation - Scopus: 2Distortion of Embeddings of Binary Trees Into Diamond Graphs(Amer Mathematical Soc, 2018) Leung, Siu Lam; Nelson, Sarah; Ostrovska, Sofiya; Ostrovskii, MikhailDiamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other; for example superreflexivity of Banach spaces can be characterized both in terms of binary trees (Bourgain, 1986) and diamond graphs (Johnson-Schechtman, 2009). In this connection, it is natural to ask whether one of these families admits uniformly bilipschitz embeddings into the other. This question was answered in the negative by Ostrovskii (2014), who left it open to determine the order of growth of the distortions. The main purpose of this paper is to get a sharp up-to-a-logarithmic-factor estimate for the distortions of embeddings of binary trees into diamond graphs and, more generally, into diamond graphs of any finite branching k >= 2. Estimates for distortions of embeddings of diamonds into infinitely branching diamonds are also obtained.
