16 results
Search Results
Now showing 1 - 10 of 16
Article Fedja’s Proof of Deepti’s Inequality(Tubitak Scientific & Technological Research Council Turkey, 2018) Ostrovska, Sofiya; Turan, MehmetThe paper aims to present, in a systematic way, an elegant proof of Deepti’s inequality. Both the inequalityand various ideas concerning the issue were discussed on the Mathoverflow website by a number of users, but none haveappeared in the literature thus far. In this work, suggestions pertaining to users ‘Deepti’ and ‘fedja’ are traced, whencethe title. The results or the paper are new, and the proof is divided into a series of statements, many of which are ofinterest in themselves.Article Citation - WoS: 1Citation - Scopus: 1The Distance Between Two Limit q-bernstein Operators(Rocky Mt Math Consortium, 2020) Ostrovska, Sofiya; Turan, MehmetFor q is an element of (0, 1), let B-q denote the limit q-Bernstein operator. The distance between B-q and B-r for distinct q and r in the operator norm on C[0, 1] is estimated, and it is proved that 1 <= parallel to B-q - B-r parallel to <= 2, where both of the equalities can be attained. Furthermore, the distance depends on whether or not r and q are rational powers of each other. For example, if r(j) not equal q(m) for all j, m is an element of N, then parallel to B-q - B-r parallel to = 2, and if r = q(m) for some m is an element of N, then parallel to B-q - B-r parallel to = 2(m - 1)/m.Article Citation - WoS: 1Citation - Scopus: 1On the Rate of Convergence for the q-durrmeyer Polynomials in Complex Domains(Walter de Gruyter Gmbh, 2024) Gurel, Ovgu; Ostrovska, Sofiya; Turan, MehmetThe q-Durrmeyer polynomials are one of the popular q-versions of the classical operators of approximation theory. They have been studied from different points of view by a number of researchers. The aim of this work is to estimate the rate of convergence for the sequence of the q-Durrmeyer polynomials in the case 0 < q < 1. It is proved that for any compact set D subset of C, the rate of convergence is O(q(n)) as n -> infinity. The sharpness of the obtained result is demonstrated.Article On the Injectivity With Respect To q of the Lupas q-transform(Taylor & Francis Ltd, 2024) Yilmaz, Ovgue Gurel; Ostrovska, Sofiya; Turan, MehmetThe Lupas q-transform has first appeared in the study of the Lupas q-analogue of the Bernstein operator. Given 0 < q < 1 and f is an element of C[0, 1], the Lupas q-transform is defined by Lambda(q)(f; x) Pi(infinity)(k=0) 1/1 + q(k)x Sigma(k=0)f(1 - q(k))q(k(k-1)/2)x(k)/(1 - q)(1 - q(2)) center dot center dot center dot (1 - q(k)), x >= 0. During the last decades, this transform has been investigated from a variety of angles, including its analytical, geometric features, and properties of its block functions along with their sums. As opposed to the available studies dealing with a fixed value of q, the present work is focused on the injectivity of Lambda(q) with respect to parameter q. More precisely, the conditions on f such that equality Lambda(q)(f; x) = Lambda(r)(f; x); x >= 0 implies q = r have been established.Article Citation - WoS: 2Citation - Scopus: 2On the eigenfunctions of the q-Bernstein operators(Springer Basel Ag, 2023) Ostrovska, Sofiya; Turan, MehmetThe eigenvalue problems for linear operators emerge in various practical applications in physics and engineering. This paper deals with the eigenvalue problems for the q-Bernstein operators, which play an important role in the q-boson theory of modern theoretical physics. The eigenstructure of the classical Bernstein operators was investigated in detail by S. Cooper and S. Waldron back in 2000. Some of their results were extended for other Bernstein-type operators, including the q-Bernstein and the limit q-Bernstein operators. The current study is a pursuit of this research. The aim of the present work is twofold. First, to derive for the q-Bernstein polynomials analogues of the Cooper-Waldron results on zeroes of the eigenfunctions. Next, to present in detail the proof concerning the existence of non-polynomial eigenfunctions for the limit q-Bernstein operator.Article On the Lupas q-transform of Unbounded Functions(Walter de Gruyter Gmbh, 2023) Ostrovska, Sofiya; Turan, MehmetThe Lupa , s q-transform comes out naturally in the study of the Lupa , s q-analogue of the Bernstein operator. It is closely related to the Heine q-distribution which has a numerous application in q-boson operator calculus and to the Valiron method of summation for divergent series. In this paper, the Lupa , s q-transform (lambda(q)f)(z), q is an element of (0, 1), of unbounded functions is considered in distinction to the previous researches, where only the case f is an element of C[0, 1] have been investigated. First, the condition for a function to possess the Lupa , s q-transform is presented. Also, results concerning the connection between growth rate of the function f (t) as t -> 1(-) and the growth of its Lupa , s q-transform (lambda(q)f)(z) as z -> infinity are established. (c) 2023 Mathematical Institute Slovak Academy of SciencesArticle Uncorrelatedness Sets of Discrete Random Variables Via Vandermonde-Type Determinants(Walter de Gruyter Gmbh, 2019) Turan, Mehmet; Ostrovska, Sofiya; Ozban, Ahmet YasarGiven random variables X and Y having finite moments of all orders, their uncorrelatedness set is defined as the set of all pairs (j, k) is an element of N-2; for which X-j and Y-kappa are uncorrelated. It is known that, broadly put, any subset of N-2 can serve as an uncorrelatedness set. This claim is no longer valid for random variables with prescribed distributions, in which case the need arises so as to identify the possible uncorrelatedness sets. This paper studies the uncorrelatedness sets for positive random variables uniformly distributed on three points. Some general features of these sets are derived. Two related Vandermonde-type determinants are examined and applied to describe uncorrelatedness sets in some special cases. (C) 2019 Mathematical Institute Slovak Academy of SciencesArticle On the Eigenstructure of the Modified Bernstein Operators(Taylor & Francis inc, 2022) Yilmaz, Ovgu Gurel; Ostrovska, Sofiya; Turan, MehmetStarting from the well-known work of Cooper and Waldron published in 2000, the eigenstructure of various Bernstein-type operators has been investigated by many researchers. In this work, the eigenvalues and eigenvectors of the modified Bernstein operators Q(n) have been studied. These operators were introduced by S. N. Bernstein himself, in 1932, for the purpose of accelerating the approximation rate for smooth functions. Here, the explicit formulae for the eigenvalues and corresponding eigenpolynomials together with their limiting behavior are established. The results show that although some outcomes are similar to those for the Bernstein operators, there are essentially different ones as well.Article Citation - WoS: 5Citation - Scopus: 4On the Block Functions Generating the Limit q-lupas Operator(Taylor & Francis Ltd, 2023) Ostrovska, Sofiya; Turan, MehmetThe limit q-Lupas operator emerged in the study of the Lupas q-analogue of the Bernstein operator. Afterward, it has been found that it is connected to numerical analysis, computer aided geometric design, probability theory and other areas. In this paper, properties of block functions generating the limit q-Lupas operator have been investigated.Article Citation - WoS: 13Citation - Scopus: 20A Generalized Arnold's Cat Map Transformation for Image Scrambling(Springer, 2022) Tora, Hakan; Gokcay, Erhan; Turan, Mehmet; Buker, MohamedThis study presents a new approach to generate the transformation matrix for Arnold's Cat Map (ACM). Matrices of standard and modified ACM are well known by many users. Since the structure of the possible matrices is known, one can easily select one of them and use it to recover the image with several trials. However, the proposed method generates a larger set of transform matrices. Thus, one will have difficulty in estimating the transform matrix used for scrambling. There is no fixed structure for our matrix as in standard or modified ACM, making it much harder for the transform matrix to be discovered. It is possible to use different type, order and number of operations to generate the transform matrix. The quality of the shuffling process and the strength against brute-force attacks of the proposed method is tested on several benchmark images.
