Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 186 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 41 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 440 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Chaotic behavior of the $p$-adic Potts-Bethe mapping II (1909.04284v1)

Published 10 Sep 2019 in math.DS, math-ph, and math.MP

Abstract: In our previous investigations, we have developed the renormalization group method to $p$-adic $q$-state Potts model on the Cayley tree of order $k$. This method is closely related to the examination of dynamical behavior of the $p$-adic Potts-Bethe mapping which depends on parameters $q,k$. In \cite{MFKh18} we have considered the case when $q$ is not divisible by $p$, and under some conditions it was established that the mapping is conjugate to the full shift. The present paper is a continuation of the mentioned paper, but here we investigate the case when $q$ is divisible by $p$ and $k$ is arbitrary. We are able to fully describe the dynamical behavior of the $p$-adic Potts-Bethe mapping by means of Markov partition. Moreover, the existence of Julia set is established, over which the mapping enables a chaotic behavior. We point out that a similar result is not known in the case of real numbers (with rigorous proofs).

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.