Chain recurrent shifts on trees
Functional Analysis
2026-05-14 v3
Abstract
We characterize when a weighted backward shift is chain recurrent on the () and 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 , , , and .
Keywords
Cite
@article{arxiv.2603.18878,
title = {Chain recurrent shifts on trees},
author = {Andrew Mortensen and David Walmsley},
journal= {arXiv preprint arXiv:2603.18878},
year = {2026}
}