Some interesting problems
نویسنده
چکیده
1.5∗ (A.Ostaszewski, email 9-92) Consider Telgarsky’s game G(T ) where T ⊆ 2. Player I plays a countable cover of T Player II chooses onesay Xn. Player I wins iff ∩{cl(Xn) : n ∈ ω} ⊆ T . It is known that (a) Player I has winning strategy iff T is analytic. (b) If there exists A an analytic subset of cl(T ) not Borel separated from T , then Player II has a winning strategy. Is the converse of (b) true? 1.6∗ Does there exists an analytic set which is not Borel modulo Ramsey null? Same question for the ideal generated by closed measure zero sets. For measure see Grzegorek and Ryll-Nardzewski [74].
منابع مشابه
Some new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملNew classes of Lyapunov type inequalities of fractional $Delta$-difference Sturm-Liouville problems with applications
In this paper, we consider a new study about fractional $Delta$-difference equations. We consider two special classes of Sturm-Liouville problems equipped with fractional $Delta$-difference operators. In couple of steps, the Lyapunov type inequalities for both classes will be obtained. As application, some qualitative behaviour of mentioned fractional problems such as stability, ...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملDefining Interesting Research Problems Steven
We argue that research problems are only interesting relative to some external audience. Interesting academic research should impact, at least, that external audience. Hence, we should target our research toward specific external audiences. Several foreboding trends that exacerbate the urgency of this targeting are discussed. To facilitate the targeting task, a partial list of fifteen possible ...
متن کاملExtracting ’Significant’ Patterns from Musical Strings: Some Interesting Problems
In this paper a number of issues relating to the application of string processing techniques on musical sequences are discussed. Special attention is given to musical pattern extraction. Firstly, a number of general problems are presented in terms of musical representation and pattern processing methodologies. Then a number of interesting melodic pattern matching problems are presented. Finally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004