Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Dynamics of flows and maps (continuous and discrete time), including infinite-dimensional dynamics, Hamiltonian dynamics, ergodic theory.
6
votes
Accepted
Non wandering sets and limit sets
Consider the shift space $X \subset \{0,1\}^{\mathbb{Z}}$ obtained by forbidding the words $1 0^m 1^n 0$ for all $m, n \geq 1$, and denote the shift map on $X$ by $\sigma$.
Since a point of $X$ can co …
4
votes
Accepted
Minimal subshift with some $x \in X$ such that $x_{(-\infty,0)}.x_0x_0x_{(0,\infty)} \in X$?
We can produce such a subshift by a standard hierarchical construction.
Let $w_{0,0} = 01$ and $w_{0,1} = 011$.
For each $k \geq 0$, define $w_{k+1,0} = w_{k,0} w_{k,0} w_{k,1}$ and $w_{k+1,1} = w_{k, …
1
vote
Accepted
Topologically transitive dynamical system mapping space into ball
No.
Let $\phi$ be the left shift on the set $X = \{0,1\}^\mathbb{Z}$ of bi-infinite binary sequences with the prodiscrete topology, and let $V = \{ x \in X : x_0 = 0 \}$ be the set of sequences that …
3
votes
Accepted
Reversal of open cover with topologically transitive dynamical system
No, even if we assume $\nu$ to be invariant under $\phi$.
Let $X = \{0,1\}^\mathbb{Z}$ be the set of two-way infinite binary sequences with the prodiscrete topology, and let $\phi$ be the left shift …
6
votes
Accepted
Entropy-minimal subshifts
Let $f$ be a sublinear function that tends to infinity, such as $f(n) = \sqrt{n}$. Define $X \subset \{0,1,2\}^{\mathbb{N}}$ by forbidding all long enough words $w$ with more than $f(|w|)$ occurrences …