Compactness properties of weighted summation operators on trees-the critical case

Mikhail Lifshits; Werner Linde

Displaying similar documents to “Compactness properties of weighted summation operators on trees-the critical case”

The minimum tree for a given zero-entropy period.

Barrabés, Esther, Juher, David (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

An axiomatic theory of information trees

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

Banach Center Publications

Similarity:

On Entropy Bumps for Calderón-Zygmund Operators

Michael T. Lacey, Scott Spencer (2015)

Concrete Operators

Similarity:

We study twoweight inequalities in the recent innovative language of ‘entropy’ due to Treil-Volberg. The inequalities are extended to Lp, for 1 < p ≠ 2 < ∞, with new short proofs. A result proved is as follows. Let ℇ be a monotonic increasing function on (1,∞) which satisfy [...] Let σ and w be two weights on Rd. If this supremum is finite, for a choice of 1 < p < ∞, [...] then any Calderón-Zygmund operator T satisfies the bound [...]

Hubbard trees

Alfredo Poirier (2010)

Fundamenta Mathematicae

Similarity:

We provide a full classification of postcritically finite polynomials as dynamical systems by means of Hubbard trees. The information encoded in these objects is solid enough to allow us recover all the relevant statical and dynamical aspects of the corresponding Julia sets.

Analyzing sets of phylogenetic trees using metrics

Damian Bogdanowicz (2011)

Applicationes Mathematicae

Similarity:

The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split...

Deducing Properties of Trees From Their Matula Numbers

Ivan Gutman, Yeong-Nan Yeh (1993)

Publications de l'Institut Mathématique

Similarity:

Dynamics on Hubbard trees

Lluís Alsedà, Núria Fagella (2000)

Fundamenta Mathematicae

Similarity:

It is well known that the Hubbard tree of a postcritically finite complex polynomial contains all the combinatorial information on the polynomial. In fact, an abstract Hubbard tree as defined in [23] uniquely determines the polynomial up to affine conjugation. In this paper we give necessary and sufficient conditions enabling one to deduce directly from the restriction of a quadratic Misiurewicz polynomial to its Hubbard tree whether the polynomial is renormalizable, and in this case,...