# Tag Info

5

The answer is yes: there is a topologically transitive dynamical system without dense orbits. Indeed, let X be a topological space that is not separable. Let $\ K=X^{\Bbb Z},\$ and let $\ G\$ be the group of homeomorphism of $\ K,\$ induced by shifts $\ s_n\ (n\in\Bbb Z)\$ of $\ \Bbb Z:\$  \forall_{n\in\Bbb Z}\forall_{x\in\Bbb Z}\quad ...

4

A partial solution: As mentioned by @MargaretFriedland, the desired $M_a(r)$ is the absolute maximum of $g(t):=\sqrt{{\rm{e}}^{2r\cos t}+2a{\rm{e}}^{r\cos t}\cos(r\sin t)+a^2}$. Notice that this is an even function, so it suffices to maximize over $[0,\pi]$. If $t\in\left[\frac{\pi}{2},\pi\right]$, then $\cos t<0$. So ${\rm{e}}^{2r\cos t}\in [0,1]$ and, ...

4

An answer before the numerics start: First, note that for $w=u+iv \in \mathbb{C}$ and a fixed $a \in \mathbb{R}$ we have $|w+a|=\sqrt{u^2+v^2+2au+a^2}=\sqrt{|w|^2 + 2au+a^2}$ . Next, consider the image under the complex exponential of the circle $|z|=r>0$. Using polar coordinates, we get $|\exp (r\cos t+i r\sin t)|=e^{r\cos t}$. Thus to get $M_a(r)$ we ...

3

This is a fun pair of exercises (the first one you mention is 3.2.9 and the second is 2.3.6a)! For 2.3.6a, recode to a $1$-block code $\phi$ on an irreducible edge shift $X$, suppose that $x, x' \in X$ are such that $x \neq x'$ but $\phi(x) = \phi(x')$. Consider two cases: either $x_j \neq x_j'$ for either all $j > i$ or all $j < i$; or there exist $j &... 2 It turns out that this problem is independent of ZFC because of the following simple Theorem. Under$\mathfrak t=\mathfrak c$, every topologically transitive continuous action of a group$G$on$\omega^*$has a dense orbit. Proof. Let$(A_\alpha)_{\alpha\in\mathfrak c}$be an enumeration of all infinite subsets of$\omega\$. By transfinite induction we ...

2

One should always keep in mind that the natural substrate of ergodic theory is Lebesgue-Rokhlin (aka Lebesgue or standard) measure spaces which enjoy a lot of properties not necessarily present in general measure spaces. One of these properties is an explicit description of homomorphisms of such spaces obtained by Rokhlin in his 1949 paper, which, in ...

1

Assuming that a closed formula is not accessible, possibly maxmod, which calculates the maximum modulus of a complex polynomial on the unit disk, would speed a numerical attack. (Polynomial order of a few hundred is not a problem.)

Only top voted, non community-wiki answers of a minimum length are eligible