All Questions
Tagged with symbolic-dynamics graph-theory
7 questions
3
votes
0
answers
74
views
Second eigenvalue of primitive matrix
Let $A$ be a primitive $N\times N$-matrix with positive entries, that is there is $n>0$ such that $(A^n)_{i,j}>0$ for all $i,j$. For brevity, assume the entries consist only of $0$ and $1$.
The ...
- 143
0
votes
0
answers
73
views
Show that two matrices are strongly shift equivalent
The following question is from Introduction to dynamical systems, written by Michael Brin and Garrett Stuclk.
Given two non-negative integer square matrices $A, B$, we say $A, B$ are elementarily ...
- 307
4
votes
1
answer
139
views
Asymptotic colouring of edges and vertices, and untwisting cocycles
This question regards colourings on edges and vertices on countable directed multigraphs.
We start with an example. Let $G=\mathbb Z^2$. We define two functions $a_h$ and $a_v$ from $\mathbb Z^2$ to $\...
8
votes
1
answer
436
views
The graph of Rule 110 and vertices degree
Consider the elementary cellular automaton called Rule 110 (famous for being Turing complete):
It induces a map $R: \mathbb{N} \to \mathbb{N}$ such that the binary representation of $R(n)$ is ...
8
votes
0
answers
269
views
Shift on trivalent directed tree, operator and von Neumann algebra
Let $\mathcal{T}$ be the trivalent directed tree, with two parents and one child for each vertex (see below). Let $\mathcal{V}$ be the set of vertices of $\mathcal{T}$ and $H$ be the Hilbert space $\...
3
votes
1
answer
466
views
Cycles in directed graphs
Let G be a finite directed graph (allowing multiple edges). We define a cycle (as usual) to be a sequence of edges $e_0, e_1, \dots, e_{n-1}$ (up to cyclic permutation) such that the terminal vertex ...
- 4,679
4
votes
1
answer
224
views
Graph presentation of Lexicographic shifts
Consider a finite alphabet $\{0,1, \ldots, n-1\}$. Let $\Sigma_n = \mathop{\prod}\limits_{j=1}^{\infty}\{0, \ldots n-1\}$ be the set of infinite one sided sequences and $\prec$ the lexicographic ...
