相关论文: Trees in renorming theory

We say that a smooth normed space $X$ has a property (SL), if every mapping $f:X \to X$ preserving the semi-inner product on $X$ is linear. It is well known that every Hilbert space has the property (SL) and the same is true for every…

In this article, we examine the theorem of Mattila establishing rectifiability for regular sets in the setting of strictly convex, finite-dimensional Banach spaces.

Inside the discipline of graph theory exists an extension known as the hypergraph. This generalization of graphs includes vertices along with hyperedges consisting of collections of two or more vertices. One well-studied application of this…

In this paper, we continue the investigation of topological properties of unbounded norm (un-)topology in normed lattices. We characterize separability and second countability of un-topology in terms of properties of the underlying normed…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

The notions of $p$-convexity and concavity are fundamental tools for studying Banach lattices, as they partition the class of Banach lattices into a scale of spaces with $L_p$-like properties. Upper and lower $p$-estimates provide a…

We study the unknown differences between the size of slices and relatively weakly open subsets of the unit ball in Banach spaces. We show that every Banach space containing isomorphic copies of $c_0$ can be equivalently renormed so that…

A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. I give constructions of such trees which are both rigid (i.e. without non-trivial order-automorphisms) and uniform (in two…

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the…

We study unitarity and renormalizability in the Lifshitz scalar field theory, which is characterized by an anisotropic scaling between the space and time directions. Without the Lorentz symmetry, both the unitarity and the renormalizability…

In this paper we establish some new results concerning the Cauchy-Peano problem in Banach spaces. Firstly, we prove that if a Banach space $E$ admits a fundamental biorthogonal system, then there exists a continuous vector field $f\colon…

The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…

We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…

We show that if $x$ is a strongly extreme point of a bounded closed convex subset of a Banach space and the identity has a geometrically and topologically good enough local approximation at $x$, then $x$ is already a denting point. It turns…

Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus,…

Results of a previous paper [Commun. Contemp. Math., 09 (2007) 217-251] on the existence of solutions to a nonlinear evolution equation in an abstract Lebesgue space, arising from kinetic theory, are re-obtained in the more general setting…

The restricted strong convexity is an effective tool for deriving globally linear convergence rates of descent methods in convex minimization. Recently, the global error bound and quadratic growth properties appeared as new competitors. In…

We augment the dimension of the Euclidean space by one and the Picard iteration of a contraction by a simple iteration on the real line such that the resulting iteration becomes monotone increasing and bounded with respect to the order…

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…