ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Entropy of subshifts of finite type

Let GG be a finitely generated infinite ameanable group, AA be a finite alphabet and define F={f:B→A:B⊆G finite}\mathcal{F} = \left\{f:B \rightarrow A: B \subseteq G \text{ finite}\right\} a finite set of forbidden patterns and SG,F,A={x∈AG:x contains no forbidden subpatterns}.S_{G,\mathcal{F}, A} = \left\{x \in A^G: x \text{ contains no forbidden subpatterns}\right\}.

GG acts on SG,F,AS_{G,\mathcal{F}, A} on both sides as the regular representation, namely, permuting the coordinates of the sequences by right or left translation. Choose {Fn}n∈N\left\{F_n\right\}_{n \in \mathbb{N}} a Følner sequence for GG and define HG,F,A=lim⁡n→+∞log⁡(#{f:Fn→A: f appears in some x∈SG,F,A})n.\mathcal{H}_{G, \mathcal{F}, A} = \lim_{n \rightarrow +\infty} \frac{\log \left( \# \left\{f: F_n \rightarrow A: \text{ $f$ appears in some $x \in S_{G,\mathcal{F}, A}$}\right\} \right)}{n}. \

It is a fact that HG,F,A\mathcal{H}_{G, \mathcal{F}, A} does not depend on the selected Følner sequence. Define also EG={HG,F,A:F is a finite set of forbidden subwords}.E_G = \left\{\mathcal{H}_{G, \mathcal{F}, A}: \mathcal{F} \text{ is a finite set of forbidden subwords}\right\}.

It is known (see \cite{MR2680402}) that EZ={qlog⁡(λ):q∈Q+, and λ is a Perron eigenvalue}E_{\mathbb{Z}} = \left\{q\log(\lambda): q \in \mathbb{Q}^+, \text{ and $\lambda$ is a Perron eigenvalue}\right\} and EZ2={r∈R+: r is a right-recursively enumerable number},E_{\mathbb{Z}^2} = \left\{r \in \mathbb{R}^+: \text{ $r$ is a right-recursively enumerable number}\right\}, where a Perron eigenvalue is the eigenvalue given by the Perron-Frobenius theorem of a square matrix with non-positive entries such that for some power of the matrix, the entries are all positive, and a right recursively enumerable number is the infimum of the image of a computable function f:N→Qf: \mathbb{N} \rightarrow \mathbb{Q}.

\begin{enumerate} \item Given a recursively presented and finitely generated infinite amenable group GG, what is EGE_G? \item Does there exist a recursively presented and finitely generated infinite amenable group GG such that EZ⊊EG⊊EZ2E_\mathbb{Z} \subsetneq E_G \subsetneq E_{\mathbb{Z}^2}? \end{enumerate}

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.