Finite-kernel entropy rescaling and obstructions to intermediate SFT spectra
Statement
Entropy of subshifts of finite type
Let be a finitely generated infinite ameanable group, be a finite alphabet and define a finite set of forbidden patterns and
acts on on both sides as the regular representation, namely, permuting the coordinates of the sequences by right or left translation. Choose a Følner sequence for and define \
It is a fact that does not depend on the selected Følner sequence. Define also
It is known (see \cite{MR2680402}) that and 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 .
\begin{enumerate} \item Given a recursively presented and finitely generated infinite amenable group , what is ? \item Does there exist a recursively presented and finitely generated infinite amenable group such that ? \end{enumerate}
Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.