Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuasi-graphs, zero entropy and measures with discrete spectrum
76
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper, we study dynamics of maps on quasi-graphs characterizing their invariant measures. In particular, we prove that every invariant measure of quasi-graph map with zero topological entropy has discrete spectrum. Additionally, we obtain an analog of Llibre-Misiurewiczs result relating positive topological entropy with existence of topological horseshoes. We also study dynamics on dendrites and show that if a continuous map on a dendrite, whose set of all endpoints is closed and has only finitely many accumulation points, has zero topological entropy, then every invariant measure supported on an orbit closure has discrete spectrum.
rate research
Read More
We show that Sarnaks conjecture on Mobius disjointness holds in every uniquely ergodic modelof a quasi-discrete spectrum automorphism. A consequence of this result is that, for each non constant polynomial $PinR[x]$ with irrational leading coefficient and for each multiplicative function $bnu:NtoC$, $|bnu|leq1$, we have[ frac{1}{M} sum_{Mle mtextless{}2M} frac{1}{H} left| sum_{mle n textless{} m+H} e^{2pi iP(n)}bnu(n) right|longrightarrow 0 ] as $Mtoinfty$, $Htoinfty$, $H/Mto 0$.
In this paper, we study affine transformations on tori, nilmanifolds and compact abelian groups. For these systems, we show that an equivalent condition for zero entropy is the orbit closure of each point has a nice structure. To be precise, the affine systems on those spaces are zero entropy if and only if the orbit closure of each point is isomorphic to an inverse limit of nilsystems.
We study homeomorphisms of compact metric spaces whose restriction to the nonwandering set has the pseudo-orbit tracing property. We prove that if there are positively expansive measures, then the topological entropy is positive. Some short applications of this result are included.
Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of attractor, update rules and update orders. We prove results on attractors for different utility functions and update orders. For complete graphs we characterize attractors for synchronous and sequential update rules. In other cases (for $k$-regular graphs or for different update orders) we provide sufficient conditions for attractivity of full cooperation and full defection. We construct examples to show that these conditions are not necessary. Finally, by formulating a list of open questions we emphasize the advantages of our rigorous approach.
In this paper, we study discrete spectrum of invariant measures for countable discrete amenable group actions. We show that an invariant measure has discrete spectrum if and only if it has bounded measure complexity. We also prove that, discrete spectrum can be characterized via measure-theoretic complexity using names of a partition and the Hamming distance, and it turns out to be equivalent to both mean equicontinuity and equicontinuity in the mean.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
