Related papers: Continuous Maps on Aronszajn Trees

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than $\aleph_1$, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all…

We extend the concept of a Hubbard tree, well established and useful in the theory of polynomial dynamics, to the dynamics of transcendental entire functions. We show that Hubbard trees in the strict traditional sense, as invariant compact…

We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…

Let J and J' be Jordan rings. We prove under some conditions that if J contains a nontrivial idempotent, then n-multiplicative maps and n-multiplicative derivations from J to J' are additive maps.

Starting with the zero-square "zeon algebra" the connection with permanents is shown. Permanents of sub-matrices of a linear combination of the identity matrix and all-ones matrix leads to moment polynomials with respect to the exponential…

A class of acyclic digraphs $\mathscr{C}$ is linearly unavoidable if there exists a constant $c$ such that every digraph $D\in \mathscr{C}$ is contained in all tournaments of order $c\cdot |V(D)|$. The class of all acyclic digraphs is not…

For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is…

Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…

We prove persistence of absolutely continuous spectrum for the Anderson model on a general class of tree-like graphs.

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

We continue the development of the theory of capturing schemes over $\omega_1$ by analyzing the relation between the capturing construction schemes (whose existence is implied by Jensen's $\Diamond$-principle) and both the Continuum…

We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the…

An edge-ordered graph is a graph with a total ordering of its edges. A path $P=v_1v_2\ldots v_k$ in an edge-ordered graph is called increasing if $(v_iv_{i+1}) > (v_{i+1}v_{i+2})$ for all $i = 1,\ldots,k-2$; it is called decreasing if…

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…

One develops {\em ab initio} the theory of rational/birational maps over reduced, but not necessarily irreducible, projective varieties in arbitrary characteristic. A numerical invariant of a rational map is introduced, called the Jacobian…

We prove the almost sure existence of absolutely continuous spectrum at low disorder for the Anderson model on the simplest example of a product of a regular tree with a finite graph. This graph contains loops of unbounded size.

We prove that a zero topological entropy continuous tree map always displays zero topological sequence entropy when it is restricted to its non-wandering and chain recurrent sets. In addition, we show that a similar result is not possible…

We develop non-invertible Pesin theory for a new class of maps called cusp maps. These maps may have unbounded derivative, but nevertheless verify a property analogous to $C^{1+\epsilon}$. We do not require the critical points to verify a…

Transcendental H\'enon maps are the natural extensions of the well investigated complex polynomial H\'enon maps to the much larger class of holomorphic automorphisms. We prove here that transcendental H\'enon maps always have non-trivial…

Invertible compositions of one-dimensional maps are studied which are assumed to include maps with non-positive Schwarzian derivative and others whose sum of distortions is bounded. If the assumptions of the Koebe principle hold, we show…