arXiv (All)
open access
$\mathcal F$-Transitivity of Backward Shifts on Lattice Graphs
We study $\mathcal F$-transitivity of backward shifts on finite- and infinite-width directed lattice graphs. For the unilateral and bilateral finite-width lattices on weighted $\ell^p$- or $c_0$-spaces, we obtain exact weight characterizations of $\mathcal F$- and $\widetilde{\mathcal F}$-transitivi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs#167718
- A Note on the Transitivity of Parthood#774947
- A note on the multicolor size-Ramsey numbers of connected graphs#128283
- Locality of Bernoulli Site Percolation on Transitive Graphs#975093
- Broadcasting-induced colorings of preferential attachment trees#240969
Record · ID 1119381
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive