Chain recurrent shifts on trees
Abstract
We characterize when a weighted backward shift is chain recurrent on the p (1≤ p<∞) and c0 spaces of a directed tree. The characterization is given in terms of two divergence conditions on the weights: a forward condition on the descendants of each vertex and, in the unrooted case, a backward condition on the descendants of each ancestor. The conditions reduce, in the case of symmetric weighted shifts on symmetric trees, to the classical characterizations of chain recurrence on the sequence spaces p(N), p(Z), c0(N), and c0(Z).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.