پایان‌نامه

fragmentability and approximation

چکیده(به انگلیسی؛ چکیده‌ی فارسی در دسترس نیست)

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization or frgmentability of kenderov-moors to construct a large class of non-fragmentable banach space. in particular, we will show that if a compact hausdorff space x contains a non-trivial converging sequence, then (c(x)/c(x), weak) is fragment by any metric, where x is the gleason extremally disconnected space corresponding to x. pedersen proved that if a is a c -algebra with unit, b a chebyshev c subalgebra of a then either ba, b1 or else a, 2 2 matrices, and b is isomorphic to the algebra of diagonal matrices. we extend his result for jb-algebras, in chapter 3, we will show that if b is a chebyshev subalgebra of a untial jb-algebra a, then either b is a trivial subalgebra of a or a has a representation of the from h , where h is a hilbert space. this connects algebraic and geometric properties of a jb-algebra. a famous problem in approximation theory is whether or not sets having unique farthest point property are singletons. klee (33) proved that any positive answer to this problem in hilbert space implies that all chebyshev sets are convex. the problem is considered in chapter 4 for two special cases, i.e, it is shown that every uniquely remotal subset of an alternative jb-algebra or -sum of banach spaces is a singleton.

اساتید راهنما و مشاور

اسدالله نیکنام

پایان‌نامه‌های مشابه

اسناد مشابه

  • Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic

    سند علمی۲۰۱۰Int. J. Approx. ReasoningBarbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas

    In this paper we investigate a technique for fusing approximate knowledge obtained from distributed, heterogeneous information sources. This issue is substantial, e.g., in modeling multiagent systems, where a group of loosely coupled heterogeneous agents cooperate in achieving a

  • Fragments of Approximate Counting

    سند علمی۲۰۱۴J. Symb. Log.Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen

    We study the long-standing open problem of giving ∀Σ1 separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and th

  • Unifying the Fixed Order Evolution of Fragmentation Functions with the Modified Leading Logarithm Approximation

    سند علمی۲۰۰۵Simon Albino, Bernd Andreas Kniehl, Gustav Kramer, Wolfgang Ochs

    An approach which unifies the Double Logarithmic Approximation at small x and the leading order DGLAP evolution of fragmentation functions at large x is presented. This approach reproduces exactly the Modified Leading Logarithm Approximation, but is more complete due to the degre

  • Bin packing with fragmentable items: Presentation and approximations

    سند علمی۲۰۱۵Theor. Comput. Sci.Bertrand Le Cun, Thierry Mautor, Franck Quessette, Marc-Antoine Weisser

    We consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. This problem is useful for modeling splittable resource allocati

  • Continuum model of wave propagation in fragmented media: linear damping approximation

    سند علمی۲۰۱۷Maxim Khudyakov, Arcady V. Dyskin, Elena Pasternak

    Energy dissipation during wave propagation in fragmented geomaterials can be caused by independent movement of fragments leading to energy loss on their impact. By considering a pair of impacting fragments at times much greater than the period of their oscillations we show that a

  • A New Approximation Algorithm for the Minimum Fragment Removal Problem

    سند علمی۲۰۰۸BIRDHatem Tahri, Mourad Elloumi

    In this paper, we present a new approximation Minimum Fragment Removal (MFR) algorithm based on a new Optimization Vertex Bipartization (OVB) one. Our approximation MFR algorithm is of complexity O(n) in computing time, where n is the number of the vertices of the conflict graph.