Questions tagged [symbolic-dynamics]
Symbolic dynamics is the study of dynamical systems defined in terms of shift transformations on spaces of sequences. Examples of topics in this area include shifts of finite type, sofic shifts, Toeplitz shifts, Markov partitions and symbolic coding of dynamical systems.
14 questions
10
votes
2
answers
1k
views
Decidability of periodic tilings of the plane
I'm interested in tilings of the plane by squares, with labels on the edges. It's well known that (1) the question "can one tile the plane with the following finite set of tiles?" is undecidable, and (...
- 2,519
5
votes
1
answer
289
views
The spectral radius of a binary matrix - polynomial growth?
(This is a follow-up to The spectral radius of a binary matrix)
Let $\mathcal B_n$ denote the set of $n\times n$ matrices with entries in $\{0,1\}$.
QUESTION. Is there a $\delta\in\bigl(0,\frac12\...
- 2,135
1
vote
1
answer
410
views
joining or coupling
given two shift invariant measures in the Bernoulli space $\{0,1\}^{\mathbb{N}}$, is there a way to construct joinings of them? It's very diffcult, in general, to find exactly the minimal joining i.e, ...
21
votes
6
answers
2k
views
Are there uncountably many cube-free infinite binary words?
In Cube-free infinite binary words it was established that there are infinitely many cube-free infinite binary words (see the earlier question for definitions of terms). The construction given in ...
- 39.9k
18
votes
2
answers
1k
views
Nice sign-expansions of special surreal numbers
What is the "right" surreal generalization of the fact that a real number $r$ is rational if and only if its sign-expansion is eventually periodic?
I can think of more than one natural way to ...
- 19.7k
9
votes
1
answer
210
views
Can the full shift be embedded in a flow?
Write $I=[0,1]$, and let $S$ be the shift on $X=\{ (x_n)_{n\in\mathbb Z} : x_n\in I^k \}$. Is there a flow $\phi_t$ on $X$ with $\phi_1=S$? Here I require that $\phi_t$, for fixed $t$, is at least a ...
- 24.2k
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 $\...
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
1
answer
631
views
Aproximating dynamical systems by intrinsically ergodic systems
Let $X$ be a compact metric space and $f:X \to X$ a continuous map. We say that $(X,f)$ is approximated from below by a sequence of compact metric spaces $(X_i)_{i \geq 1}$ and a sequence of ...
4
votes
2
answers
273
views
Lower bounds for pattern complexity of aperiodic subshifts
In the setting of symbolic dynamics over $\mathbb{Z}^d$, one can define for the $n$-th pattern complexity of a given a subshift $\Omega\subseteq \mathcal{A}^{\mathbb{Z}^d}$ as
$$ c_n(\Omega):= \Big\...
- 633
3
votes
2
answers
416
views
Fast algorithms for external angle computations
Two related problems related to the complex quadratic polynomial $f_c(z) = z^2 + c$ and Mandelbrot and/or Julia sets:
find an external angle $\theta_c$ for a complex point $c$
find a complex point $...
- 111
3
votes
2
answers
367
views
Periodic configurations for elementary cellular automata
Let $L$ be an elementary cellular automaton. Then $L$ acts on $\{0,1\}^{\mathbb{Z}}$. We say that a configuration $w\in\{0,1\}^{\mathbb{Z}}$ is periodic if $L^{(n)}(w)=w$ for some $n\in\mathbb{N}$.
...
3
votes
1
answer
121
views
Almost one-to-one endomorphism of minimal subshift?
Let $(X,T)$ be a minimal subshift. Can it happen that an endomorphism $\varphi\colon (X,T) \to (X,T)$ is almost 1-to-1 but not 1-to-1? Can it happen that a factor $\pi\colon (X,T) \to (Y,T)$ between ...
2
votes
3
answers
639
views
The critical exponent function
It is a known fact [1] that, for every $c\in (1,\infty]$, it is possible to find a finite alphabet $\mathcal{A}$ and a word $w\in \mathcal{A}^\omega$ such that $w$ has critical exponent $c$. It looks ...
- 4,459