Related papers: Mixing properties in coded systems
We present a new criterion, based on commutator methods, for the strong mixing property of unitary representations of topological groups equipped with a proper length function. Our result generalises and unifies recent results on the strong…
We prove a strong law of large numbers for a class of strongly mixing processes. Our result rests on recent advances in understanding of concentration of measure. It is simple to apply and gives finite-sample (as opposed to asymptotic)…
We show that a synchronized coded system $X$ is intrinsically ergodic of full support if and only if $ h(Y)$, the topological entropy of $Y$, is less than $h(X) $ whenever $Y$ is a proper subsystem of $ X $. We also show that like systems…
Topological phases of matter offer a promising platform for quantum computation and quantum error correction. Nevertheless, unlike its counterpart in pure states, descriptions of topological order in mixed states remain relatively…
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…
P-time event graphs (P-TEGs) are event graphs where the residence time of tokens in places is bounded by specified time windows. In this paper, we define a new property of PTEGs, called weak consistency. In weakly consistent P-TEGs, the…
Topological phase transitions track changes in topological properties of a system and occur in real materials as well as quantum engineered systems, all of which differ greatly in terms of dimensionality, symmetries, interactions, and…
In this paper, we prove several theorems relating annealed exponential mixing of the two-point motion with quenched properties of the one-point motion for conservative IID random dynamical systems. In particular, we show that annealed…
There are three key factors of a system of coupled oscillators that characterize the interaction among them: coupling (how to affect), delay (when to affect) and topology (whom to affect). For each of them, the existing work has mainly…
Systems that show different characteristics, such as finite-gain and passivity, depending on the nature of the inputs, are said to possess mixed input-output properties. In this paper, we provide a constructive method for characterizing…
We derive mixing properties for a broad class of Poisson count time series satisfying a certain contraction condition. Using specific coupling techniques, we prove absolute regularity at a geometric rate not only for stationary…
A subclass of coded systems containing synchronized systems is the family of half-synchronized systems. In this note, we will consider them and show that the property half-synchronized lifts under hyperbolic maps. This enables us to define…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
Topological collections allow to consider uniformly many data structures in programming languages and are handled by functions defined by pattern matching called transformations. We present two type systems for languages with topological…
Typical topological systems undergo a topological phase transition in the presence of a strong enough perturbation. In this paper, we propose an adjustable frustrated Toric code with a "topological line" at which no phase transition happens…
A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…
Dynamical compactness with respect to a family as a new concept of chaoticity of a dynamical system was introduced and discussed in [22]. In this paper we continue to investigate this notion. In particular, we prove that all dynamical…
We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a…