LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Counting finite orbits for the flip systems of shifts of finite type

Photo by cytonn_photography from unsplash

For a discrete system \begin{document}$ (X,T) $\end{document} , the flip system \begin{document}$ (X,T,F) $\end{document} can be regarded as the action of infinite dihedral group \begin{document}$ D_\infty $\end{document} on the space… Click to show full abstract

For a discrete system \begin{document}$ (X,T) $\end{document} , the flip system \begin{document}$ (X,T,F) $\end{document} can be regarded as the action of infinite dihedral group \begin{document}$ D_\infty $\end{document} on the space \begin{document}$ X $\end{document} . Under this action, \begin{document}$ X $\end{document} is partitioned into a set of orbits. We are interested in counting the finite orbits in this partition via the prime orbit counting function. In this paper, we prove the asymptotic behaviour of this counting function for the flip systems of shifts of finite type. The proof relies mostly on combinatorial calculations instead of the usual approach via zeta function. Here, we are able to obtain more precise asymptotic result for this \begin{document}$ D_\infty $\end{document} -action on shifts of finite type as compared to other group actions on systems available in the literature.

Keywords: shifts finite; document; end document; begin document; finite type

Journal Title: Discrete and Continuous Dynamical Systems
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.