Related papers: Continuous Maps on Aronszajn Trees
A linear mapping $T$ on a JB$^*$-triple is called triple derivable at orthogonal pairs if for every $a,b,c\in E$ with $a\perp b$ we have $$0 = \{T(a), b,c\} + \{a,T(b),c\}+\{a,b,T(c)\}.$$ We prove that for each bounded linear mapping $T$ on…
The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…
Fedorchuk's fully closed (continuous) maps and resolutions are applied in constructions of non-metrizable higher-dimensional analogues of Anderson, Choquet, and Cook's continua. Certain theorems on dimension-lowering maps are proved for…
Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…
Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2. Using a result of Alon and Wormald, we show that there exists a natural number…
We prove that every weakly square compact cardinal is a strong limit cardinal. We also study Aronszajn trees with no uncountable finitely branching subtrees, characterizing them in terms of being Lindel\"of with respect to a particular…
The notion of Aronszajn-null sets generalizes the notion of Lebesgue measure zero on the real line and the Euclidean space to infinite dimensional Banach spaces. We present a game-theoretic approach to Aronszajn-null sets, establish its…
The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…
We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…
In this article we provide a proof of the so called absolute continuity theorem for random dynamical systems on $R^d$ which have an invariant probability measure. First we present the construction of local stable manifolds in this case.…
Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $< C_\alpha | \alpha < \lambda^+ >$ with the following remarkable guessing property:…
Roberston and Seymour introduced tangles of order $k$ as objects representing highly connected parts of a graph and showed that every graph admits a tree-decomposition of adhesion $<k$ in which each tangle of order $k$ is contained in a…
Consider a continuous surjective self map of the open annulus with degree d > 1. It is proved that the number of Nielsen classes of periodic points is maximum possible whenever f has a completely invariant essential continuum. The same…
Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…
A continuum $X$ is a dendrite if it is locally connected and contains no simple closed curve, a self mapping $f$ of $X$ is called monotone if the preimage of any connected subset of $X$ is connected. If $X$ is a dendrite and $f:X\to X$ is a…
We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…
We study the dynamical properties of ball expanding maps, a class of continuous self-maps defined on compact metric spaces. For a ball expanding map, we show that: (1) the set of periodic points is dense in the chain recurrent set; (2) if…
Let B(X) be the algebra of all bounded linear operators on a complex Banach space X of dimension at least three. For an arbitrary nonzero complex number t we determine the form of mappings f: B(X)-->B(X) with sufficiently large range such…
We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of…
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…