Related papers: Mixing properties in coded systems
For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…
Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…
The vector field of a mixed-monotone system is decomposable via a decomposition function into increasing (cooperative) and decreasing (competitive) components, and this decomposition allows for, e.g., efficient computation of reachable sets…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
We exhibit rationally ergodic, weakly mixing measure preserving transformations which are not subsequence rationally weakly mixing and give a condition for smoothness of renewal sequences.
We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that…
We construct an increasing sequence of natural numbers $(m_n)_{n=1}^{+\infty}$ with the property that $(m_n \th [1])_{n\geq 1}$ is dense in $\T$ for any $\th \in \R\setminus \Q$, and a continuous measure on the circle $\mu$ such that…
A condition for the synchronizability of a pair of PDE systems, coupled through a finite set of variables, is commonly the existence of internal synchronization or internal coherence in each system separately. The condition was previously…
We show that a residual set of non-degenerate IETs on more than 3 letters is topologically mixing. This shows that there exists a uniquely ergodic topologically mixing IET. This is then applied to show that some billiard flows in a fixed…
We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove that for a…
Let $(X,d)$ be a compact metric space and $F=\{f_1,f_2,...,f_m\}$ be an $m$-tuple of continuous maps from $X$ to itself. In this paper, we introduce the definitions of transitivity, weakly mixing and mixing of multiple mappings $(X,F)$ from…
In this thesis we study properties of open quantum dissipative evolutions of spin systems on lattices described by Lindblad generators, in a particular regime that we denote rapid mixing. We consider dissipative evolutions with a unique…
Bifurcations in a system of coupled maps are investigated. Using symbolic dynamics it is proven that for coupled shift maps the well known space--time--mixing attractor becomes unstable at a critical coupling strength in favour of a…
We give an example of a dynamical system which is mixing relative to one of its factors, but for which relative mixing of order three does not hold.
A characterization of relative weak mixing in W*-dynamical systems in terms of a relatively independent joining is proven.
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
Defects in topologically ordered models have interesting properties that are reminiscent of the anyonic excitations of the models themselves. For example, dislocations in the toric code model are known as twists and possess properties that…
In this paper, we study the dynamics induced by finite commutative relation. We prove that the dynamics generated by such a non-trivial collection cannot be transitive/super-transitive and hence cannot exhibit higher degrees of mixing. As a…
A mixed Steiner system MS$(t,k,Q)$ is a set (code) $C$ of words of weight $k$ over an alphabet $Q$, where not all coordinates of a word have the same alphabet size, each word of weight $t$, over $Q$, has distance $k-t$ from exactly one…
We introduce high staircase infinite measure preserving transformations and prove that they are mixing under a restricted growth condition. This is used to (i) realize each subset $E\subset\Bbb N\cup\{\infty\}$ as the set of essential…