Displaying similar documents to “On operators which factor through l p or c₀”

On operators from separable reflexive spaces with asymptotic structure

Bentuo Zheng (2008)

Studia Mathematica

Similarity:

Let 1 < q < p < ∞ and q ≤ r ≤ p. Let X be a reflexive Banach space satisfying a lower- q -tree estimate and let T be a bounded linear operator from X which satisfies an upper- p -tree estimate. Then T factors through a subspace of ( F ) r , where (Fₙ) is a sequence of finite-dimensional spaces. In particular, T factors through a subspace of a reflexive space with an ( p , q ) FDD. Similarly, let 1 < q < r < p < ∞ and let X be a separable reflexive Banach space satisfying an asymptotic...

A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs

Yaping Mao, Christopher Melekian, Eddie Cheng (2023)

Czechoslovak Mathematical Journal

Similarity:

For a connected graph G = ( V , E ) and a set S V ( G ) with at least two vertices, an S -Steiner tree is a subgraph T = ( V ' , E ' ) of G that is a tree with S V ' . If the degree of each vertex of S in T is equal to 1, then T is called a pendant S -Steiner tree. Two S -Steiner trees are if they share no vertices other than S and have no edges in common. For S V ( G ) and | S | 2 , the pendant tree-connectivity τ G ( S ) is the maximum number of internally disjoint pendant S -Steiner trees in G , and for k 2 , the k -pendant tree-connectivity τ k ( G ) is the...

The relation between the number of leaves of a tree and its diameter

Pu Qiao, Xingzhi Zhan (2022)

Czechoslovak Mathematical Journal

Similarity:

Let L ( n , d ) denote the minimum possible number of leaves in a tree of order n and diameter d . Lesniak (1975) gave the lower bound B ( n , d ) = 2 ( n - 1 ) / d for L ( n , d ) . When d is even, B ( n , d ) = L ( n , d ) . But when d is odd, B ( n , d ) is smaller than L ( n , d ) in general. For example, B ( 21 , 3 ) = 14 while L ( 21 , 3 ) = 19 . In this note, we determine L ( n , d ) using new ideas. We also consider the converse problem and determine the minimum possible diameter of a tree with given order and number of leaves.

On a characterization of k -trees

De-Yan Zeng, Jian Hua Yin (2015)

Czechoslovak Mathematical Journal

Similarity:

A graph G is a k -tree if either G is the complete graph on k + 1 vertices, or G has a vertex v whose neighborhood is a clique of order k and the graph obtained by removing v from G is also a k -tree. Clearly, a k -tree has at least k + 1 vertices, and G is a 1-tree (usual tree) if and only if it is a 1 -connected graph and has no K 3 -minor. In this paper, motivated by some properties of 2-trees, we obtain a characterization of k -trees as follows: if G is a graph with at least k + 1 vertices, then G is...

The instability of nonseparable complete Erdős spaces and representations in ℝ-trees

Jan J. Dijkstra, Kirsten I. S. Valkenburg (2010)

Fundamenta Mathematicae

Similarity:

One way to generalize complete Erdős space c is to consider uncountable products of zero-dimensional G δ -subsets of the real line, intersected with an appropriate Banach space. The resulting (nonseparable) complete Erdős spaces can be fully classified by only two cardinal invariants, as done in an earlier paper of the authors together with J. van Mill. As we think this is the correct way to generalize the concept of complete Erdős space to a nonseparable setting, natural questions arise...

Quasi-tree graphs with the minimal Sombor indices

Yibo Li, Huiqing Liu, Ruiting Zhang (2022)

Czechoslovak Mathematical Journal

Similarity:

The Sombor index S O ( G ) of a graph G is the sum of the edge weights d G 2 ( u ) + d G 2 ( v ) of all edges u v of G , where d G ( u ) denotes the degree of the vertex u in G . A connected graph G = ( V , E ) is called a quasi-tree if there exists u V ( G ) such that G - u is a tree. Denote 𝒬 ( n , k ) = { G : G is a quasi-tree graph of order n with G - u being a tree and d G ( u ) = k } . We determined the minimum and the second minimum Sombor indices of all quasi-trees in 𝒬 ( n , k ) . Furthermore, we characterized the corresponding extremal graphs, respectively.

Spanning trees whose reducible stems have a few branch vertices

Pham Hoang Ha, Dang Dinh Hanh, Nguyen Thanh Loan, Ngoc Diep Pham (2021)

Czechoslovak Mathematical Journal

Similarity:

Let T be a tree. Then a vertex of T with degree one is a leaf of T and a vertex of degree at least three is a branch vertex of T . The set of leaves of T is denoted by L ( T ) and the set of branch vertices of T is denoted by B ( T ) . For two distinct vertices u , v of T , let P T [ u , v ] denote the unique path in T connecting u and v . Let T be a tree with B ( T ) . For each leaf x of T , let y x denote the nearest branch vertex to x . We delete V ( P T [ x , y x ] ) { y x } from T for all x L ( T ) . The resulting subtree of T is called the reducible stem...

On graceful colorings of trees

Sean English, Ping Zhang (2017)

Mathematica Bohemica

Similarity:

A proper coloring c : V ( G ) { 1 , 2 , ... , k } , k 2 of a graph G is called a graceful k -coloring if the induced edge coloring c ' : E ( G ) { 1 , 2 , ... , k - 1 } defined by c ' ( u v ) = | c ( u ) - c ( v ) | for each edge u v of G is also proper. The minimum integer k for which G has a graceful k -coloring is the graceful chromatic number χ g ( G ) . It is known that if T is a tree with maximum degree Δ , then χ g ( T ) 5 3 Δ and this bound is best possible. It is shown for each integer Δ 2 that there is an infinite class of trees T with maximum degree Δ such that χ g ( T ) = 5 3 Δ . In particular, we investigate for each...

Shadow trees of Mandelbrot sets

Virpi Kauko (2003)

Fundamenta Mathematicae

Similarity:

The topology and combinatorial structure of the Mandelbrot set d (of degree d ≥ 2) can be studied using symbolic dynamics. Each parameter is mapped to a kneading sequence, or equivalently, an internal address; but not every such sequence is realized by a parameter in d . Thus the abstract Mandelbrot set is a subspace of a larger, partially ordered symbol space, Λ d . In this paper we find an algorithm to construct “visible trees” from symbolic sequences which works whether or not the sequence...

Limited p -converging operators and relation with some geometric properties of Banach spaces

Mohammad B. Dehghani, Seyed M. Moshtaghioun (2021)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

By using the concepts of limited p -converging operators between two Banach spaces X and Y , L p -sets and L p -limited sets in Banach spaces, we obtain some characterizations of these concepts relative to some well-known geometric properties of Banach spaces, such as * -Dunford–Pettis property of order p and Pelczyński’s property of order p , 1 p < .

L -limited-like properties on Banach spaces

Ioana Ghenciu (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We study weakly precompact sets and operators. We show that an operator is weakly precompact if and only if its adjoint is pseudo weakly compact. We study Banach spaces with the p - L -limited * and the p -(SR * ) properties and characterize these classes of Banach spaces in terms of p - L -limited * and p -Right * subsets. The p - L -limited * property is studied in some spaces of operators.

Decompositions for real Banach spaces with small spaces of operators

Manuel González, José M. Herrera (2007)

Studia Mathematica

Similarity:

We consider real Banach spaces X for which the quotient algebra (X)/ℐn(X) is finite-dimensional, where ℐn(X) stands for the ideal of inessential operators on X. We show that these spaces admit a decomposition as a finite direct sum of indecomposable subspaces X i for which ( X i ) / n ( X i ) is isomorphic as a real algebra to either the real numbers ℝ, the complex numbers ℂ, or the quaternion numbers ℍ. Moreover, the set of subspaces X i can be divided into subsets in such a way that if X i and X j are in different...

A characterization of reflexive spaces of operators

Janko Bračič, Lina Oliveira (2018)

Czechoslovak Mathematical Journal

Similarity:

We show that for a linear space of operators ( 1 , 2 ) the following assertions are equivalent. (i) is reflexive in the sense of Loginov-Shulman. (ii) There exists an order-preserving map Ψ = ( ψ 1 , ψ 2 ) on a bilattice Bil ( ) of subspaces determined by with P ψ 1 ( P , Q ) and Q ψ 2 ( P , Q ) for any pair ( P , Q ) Bil ( ) , and such that an operator T ( 1 , 2 ) lies in if and only if ψ 2 ( P , Q ) T ψ 1 ( P , Q ) = 0 for all ( P , Q ) Bil ( ) . This extends the Erdos-Power type characterization of weakly closed bimodules over a nest algebra to reflexive spaces.

-sums and the Banach space / c

Christina Brech, Piotr Koszmider (2014)

Fundamenta Mathematicae

Similarity:

This paper is concerned with the isomorphic structure of the Banach space / c and how it depends on combinatorial tools whose existence is consistent with but not provable from the usual axioms of ZFC. Our main global result is that it is consistent that / c does not have an orthogonal -decomposition, that is, it is not of the form ( X ) for any Banach space X. The main local result is that it is consistent that ( c ( ) ) does not embed isomorphically into / c , where is the cardinality of the continuum,...

A note on Dunford-Pettis like properties and complemented spaces of operators

Ioana Ghenciu (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Equivalent formulations of the Dunford-Pettis property of order p ( D P P p ), 1 < p < , are studied. Let L ( X , Y ) , W ( X , Y ) , K ( X , Y ) , U ( X , Y ) , and C p ( X , Y ) denote respectively the sets of all bounded linear, weakly compact, compact, unconditionally converging, and p -convergent operators from X to Y . Classical results of Kalton are used to study the complementability of the spaces W ( X , Y ) and K ( X , Y ) in the space C p ( X , Y ) , and of C p ( X , Y ) in U ( X , Y ) and L ( X , Y ) .

On γ-labelings of trees

Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang (2005)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f:V(G) → 0,1,2,...,m that induces a labeling f’: E(G) → 1,2,...,m of the edges of G defined by f’(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a γ-labeling f is v a l ( f ) = Σ e E ( G ) f ' K ( e ) . The maximum value of a γ-labeling of G is defined as v a l m a x ( G ) = m a x v a l ( f ) : f i s a γ - l a b e l i n g o f G ; while the minimum value of a γ-labeling of G is v a l m i n ( G ) = m i n v a l ( f ) : f i s a γ - l a b e l i n g o f G ; The values v a l m a x ( S p , q ) and v a l m i n ( S p , q ) are determined for double stars S p , q . We present characterizations of connected graphs G of order n for which...