13 results
Search Results
Now showing 1 - 10 of 13
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 How Analytic Properties of Functions Influence Their Images Under the Limit q-Stancu Operator(Springer Basel AG, 2026) Gurel, Ovgu; Ostrovska, Sofiya; Turan, MehmetIn the study of various q-versions of the Bernstein polynomials, a significant attention is paid to their limit operators. The present work focuses on the impact of the limit q-Stancu operator Sq infinity,alpha on the analytic properties of functions when 0 < q < 1 and alpha > 0. It is shown that for every f is an element of C[0, 1], the function S-q,(alpha infinity)fadmits an analytic continuation into the disk {z : z+alpha/(1-q) < 1+ alpha/(1-q)}. In addition, it is proved that the more derivatives f has at x = 1, the wider this disk becomes. Further, if f is infinitely differentiable at x = 1, then the function S-q,(alpha infinity)fis entire. Finally, some growth estimates for (S-q,(alpha infinity)f)(z) are obtained.Article On the Moment-Determinacy of Power Lindley Distribution and Some Applications To Software Metrics(Acad Brasileira de Ciencias, 2021) Khalleefah, Mohammed; Ostrovska, Sofiya; Turan, MehmetThe Lindley distribution and its numerous generalizations are widely used in statistical and engineering practice. Recently, a power transformation of Lindley distribution, called the power Lindley distribution, has been introduced by M. E. Ghitany et at who initiated the investigation of its properties and possible applications. In this article, new results on the power Lindley distribution are presented. The focus of this work is on the moment-(in)determinacy of the distribution for various values of the parameters. Afterwards, certain applications are provided to describe data sets of software metrics.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 A Decomposition of the Limit Q-Bernstein Type Operators Via a Universal Factor(Springer Basel AG, 2026) Ostrovska, Sofiya; Pirimoglu, Lutfi Atahan; Turan, MehmetThe focus of this work is on the properties of the unifying operator Uq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$U_q$$\end{document} on C[0, 1], which serves as a universal left factor in a decomposition of the limit q-Bernstein type operators, L infinity,q\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_{\infty ,q}$$\end{document}. More precisely, the factorization L infinity,q=Uq degrees TL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_{\infty ,q}= U_q\circ T_L$$\end{document}, where TL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T_L$$\end{document} is a linear operator on C[0, 1] depending on L, holds. It is shown that this factorization facilitates the derivation of new results and/or the simplification of proofs for the known ones.Article Citation - WoS: 5Citation - Scopus: 5An Unrestricted Arnold's Cat Map Transformation(Springer, 2024) Turan, Mehmet; Goekcay, Erhan; Tora, HakanThe Arnold's Cat Map (ACM) is one of the chaotic transformations, which is utilized by numerous scrambling and encryption algorithms in Information Security. Traditionally, the ACM is used in image scrambling whereby repeated application of the ACM matrix, any image can be scrambled. The transformation obtained by the ACM matrix is periodic; therefore, the original image can be reconstructed using the scrambled image whenever the elements of the matrix, hence the key, is known. The transformation matrices in all the chaotic maps employing ACM has limitations on the choice of the free parameters which generally require the area-preserving property of the matrix used in transformation, that is, the determinant of the transformation matrix to be +/- 1.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pm 1.$$\end{document} This reduces the number of possible set of keys which leads to discovering the ACM matrix in encryption algorithms using the brute-force method. Additionally, the period obtained is small which also causes the faster discovery of the original image by repeated application of the matrix. These two parameters are important in a brute-force attack to find out the original image from a scrambled one. The objective of the present study is to increase the key space of the ACM matrix, hence increase the security of the scrambling process and make a brute-force attack more difficult. It is proved mathematically that area-preserving property of the traditional matrix is not required for the matrix to be used in scrambling process. Removing the restriction enlarges the maximum possible key space and, in many cases, increases the period as well. Additionally, it is supplied experimentally that, in scrambling images, the new ACM matrix is equivalent or better compared to the traditional one with longer periods. Consequently, the encryption techniques with ACM become more robust compared to the traditional ones. The new ACM matrix is compatible with all algorithms that utilized the original matrix. In this novel contribution, we proved that the traditional enforcement of the determinant of the ACM matrix to be one is redundant and can be removed.Article Citation - WoS: 1Citation - Scopus: 1The Truncated q-bernstein Polynomials in the Case q > 1(Hindawi Ltd, 2014) Turan, MehmetThe truncated q-Bernstein polynomials B-n,B-m,B-q (f; x), n is an element of N, and m is an element of N-0 emerge naturally when the q-Bernstein polynomials of functions vanishing in some neighbourhood of 0 are considered. In this paper, the convergence of the truncated q-polynomials on [0, 1] is studied. To support the theoretical results, some numerical examples are provided.Article Citation - WoS: 2Citation - Scopus: 2The Impact of the Limit q-durrmeyer Operator on Continuous Functions(Springer Heidelberg, 2024) Yilmaz, Ovgu Gurel; Ostrovska, Sofiya; Turan, MehmetThe limit q-Durrmeyer operator, D-infinity,D-q, was introduced and its approximation properties were investigated by Gupta (Appl. Math. Comput. 197(1):172-178, 2008) during a study of q-analogues for the Bernstein-Durrmeyer operator. In the present work, this operator is investigated from a different perspective. More precisely, the growth estimates are derived for the entire functions comprising the range of D-infinity,D-q. The interrelation between the analytic properties of a function f and the rate of growth for D(infinity,q)f are established, and the sharpness of the obtained results are demonstrated.Article Citation - WoS: 2Citation - Scopus: 2HOW DO SINGULARITIES OF FUNCTIONS AFFECT THE CONVERGENCE OF q-BERNSTEIN POLYNOMIALS?(Element, 2015) Ostrovska, Sofiya; Ozban, Ahmet Yasar; Turan, MehmetIn this article, the approximation of functions with a singularity at alpha is an element of (0, 1) by the q-Bernstein polynomials for q > 1 has been studied. Unlike the situation when alpha is an element of (0, 1) \ {q(-j)} j is an element of N, in the case when alpha = q(-m), m is an element of N, the type of singularity has a decisive effect on the set where a function can be approximated. In the latter event, depending on the types of singularities, three classes of functions have been examined, and it has been found that the possibility of approximation varies considerably for these classes.Article On Quasi-Weibull Distribution(Univ Miskolc inst Math, 2025) Ostrovska, Sofiya; Turan, MehmetExponential distribution together with a variety of its transformations is permanently used both in probability theory and related fields. The most popular one is the power transformation yielding the Weibull distribution. In this paper, the power distribution of exponential random variable is supplemented by a logarithmic factor leading to a new distribution called quasi-Weibull. This is a three-parameter distribution, where one parameter is inherited from the underlying exponential distribution, and the others originate from the transformation. The properties of the quasi-Weibull distribution are studied. Specifically, the impact of the parameters on the analyticity of characteristic function, the existence of the moment generating function, the moment-determinacy/indeterminacy and the behaviour of the hazard function are investigated.
