Displaying similar documents to “Embedding into Banach spaces with finite dimensional decompositions.”

Infinite asymptotic games

Christian Rosendal (2009)

Annales de l’institut Fourier

Similarity:

We study infinite asymptotic games in Banach spaces with a finite-dimensional decomposition (F.D.D.) and prove that analytic games are determined by characterising precisely the conditions for the players to have winning strategies. These results are applied to characterise spaces embeddable into ℓ p sums of finite dimensional spaces, extending results of Odell and Schlumprecht, and to study various notions of homogeneity of bases and Banach spaces. The results are related to questions...

A survey on the Szlenk index and some of its applications.

Gilles Lancien (2006)

RACSAM

Similarity:

We describe how the Szlenk index has been used in various areas of the geometry of Banach spaces. We cover the following domains of application of this notion: non existence of universal spaces, linear classification of C(K) spaces, descriptive set theory, renorming problems and non linear classification of Banach spaces.

The cofinal property of the reflexive indecomposable Banach spaces

Spiros A. Argyros, Theocharis Raikoftsalis (2012)

Annales de l’institut Fourier

Similarity:

It is shown that every separable reflexive Banach space is a quotient of a reflexive hereditarily indecomposable space, which yields that every separable reflexive Banach is isomorphic to a subspace of a reflexive indecomposable space. Furthermore, every separable reflexive Banach space is a quotient of a reflexive complementably ℓ p -saturated space with 1 < p < ∞ and of a c 0 saturated space.

Arbology: Trees and pushdown automata

Bořivoj Melichar, Jan Janoušek, Tomas Flouri (2012)

Kybernetika

Similarity:

We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown...