English

Chain recurrent shifts on trees

Functional Analysis 2026-05-14 v3

Abstract

We characterize when a weighted backward shift is chain recurrent on the p\ell^p (1p<1\leq p<\infty) and c0c_0 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)\ell^p(\mathbb{N}), p(Z)\ell^p(\mathbb{Z}), c0(N)c_0(\mathbb{N}), and c0(Z)c_0(\mathbb{Z}).

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}
}
R2 v1 2026-07-01T11:28:06.117Z