The dual of the James tree space is asymptotically uniformly convex

Maria Girardi

The search session has expired. Please query the service again.

Displaying similar documents to “The dual of the James tree space is asymptotically uniformly convex”

Minimal trees and monophonic convexity

Jose Cáceres, Ortrud R. Oellermann, M. L. Puertas (2012)

Discussiones Mathematicae Graph Theory

Similarity:

Let V be a finite set and 𝓜 a collection of subsets of V. Then 𝓜 is an alignment of V if and only if 𝓜 is closed under taking intersections and contains both V and the empty set. If 𝓜 is an alignment of V, then the elements of 𝓜 are called convex sets and the pair (V,𝓜 ) is called an alignment or a convexity. If S ⊆ V, then the convex hull of S is the smallest convex set that contains S. Suppose X ∈ ℳ. Then x ∈ X is an extreme point for X if X∖{x} ∈ ℳ. A convex geometry on a finite...

On the normal disconnection of a tree

A. Kośliński (1987)

Applicationes Mathematicae

Similarity:

Deducing Properties of Trees From Their Matula Numbers

Ivan Gutman, Yeong-Nan Yeh (1993)

Publications de l'Institut Mathématique

Similarity:

Some Results on Maps That Factor through a Tree

Roger Züst (2015)

Analysis and Geometry in Metric Spaces

Similarity:

We give a necessary and sufficient condition for a map deffned on a simply-connected quasi-convex metric space to factor through a tree. In case the target is the Euclidean plane and the map is Hölder continuous with exponent bigger than 1/2, such maps can be characterized by the vanishing of some integrals over winding number functions. This in particular shows that if the target is the Heisenberg group equipped with the Carnot-Carathéodory metric and the Hölder exponent of the map...

Completely Independent Spanning Trees in (Partial) k-Trees

Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...

On A-Trees

Đuro Kurepa (1968)

Publications de l'Institut Mathématique

Similarity:

Thompson's group $F (n)$ is not minimally almost convex.

Wladis, Claire (2007)

The New York Journal of Mathematics [electronic only]

Similarity:

An axiomatic theory of information trees

Keh-Hsun Chen, Zbigniew W. Ras (1988)

Banach Center Publications

Similarity:

On the structure of path-like trees

F.A. Muntaner-Batle, Miquel Rius-Font (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

On some hypotheses concerning trees.

D. Kurepa (1977)

Publications de l'Institut Mathématique [Elektronische Ressource]

Similarity:

Some remarks on the enumeration of rooted trees

Z. A. Łomnicki (1973)

Applicationes Mathematicae

Similarity:

A characterization of (γₜ,γ₂)-trees

You Lu, Xinmin Hou, Jun-Ming Xu, Ning Li (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respectively. It has been shown that: γₜ(T) ≤ γ₂(T) for any tree T. In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.

On the rules for the elimination of the non-canonical Morgan trees

Damir Vukičević (2009)

Kragujevac Journal of Mathematics

Similarity: