Related papers: Multiple partial rigidity rates in low complexity …

We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With $\mathbb{N}$-actions, their theory essentially reduces to the theory of minimal systems, but with $\mathbb{Z}$-actions, the class is much larger.…

Many mechanical structures, both engineered and biological, combine heavy rigid elements such as bones and beams with lightweight flexible ones such as cables and membranes. These are referred to as tensegrities, reflecting that cables can…

A quantitative regularity theory is developed for weak solutions to the parabolic system $$ \partial_t u-\mathrm{div}\,{\boldsymbol{\mathsf A}}(x,t,Du)=0 \quad\text{in }E_T\subset \mathbb{R}^N\times\mathbb{R}, $$ which features the…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with…

Let $(X,d)$ be a compact metric space and $f:X \to X$ be a self-map. The compact dynamical system $(X,f)$ is called sensitive or sensitivity depends on initial conditions, if there is a positive constant $\delta$ such that in each non-empty…

In this paper, we consider different classes of subshifts and study their perturbations obtained by forbidding sequences that contain a given word as a subword. We show that the perturbations of sofic shifts are sofic. Though not true for…

We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…

The relative entropy of entanglement $E_R$ is defined as the distance of a multi-partite quantum state from the set of separable states as measured by the quantum relative entropy. We show that this optimisation is always achieved, i.e. any…

Invariance entropy is a measure for the smallest data rate in a noiseless digital channel above which a controller that only receives state information through this channel is able to render a given subset of the state space invariant. In…

We consider weighted shift operators having the property of moment infinite divisibility; that is, for any $p > 0$, the shift is subnormal when every weight (equivalently, every moment) is raised to the $p$-th power. By reconsidering…

In this paper, we propose a mild condition, named Condition $(**)$, for collections of sequence of integers and show that for any measure preserving system the Pinsker $\sigma$-algebra is a characteristic $\sigma$-algebra for the averages…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

Given a dynamical system $(X,T)$ and a family $\mathsf{I}\subseteq \mathcal{P}(\omega)$ of "small" sets of nonnegative integers, a point $x \in X$ is said to be $\mathsf{I}$-strong universal if for each $y \in X$ there exists a subsequence…

For a large class of density matrices in semiclassical gravity, it is shown that the reduced density matrix which corresponds to tracing over the degrees of freedom in a spatial subregion is dominated by states for which the area of the…

Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

For a finite alphabet $\mathcal{A}$ and a sequence $x \in \mathcal{A}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p^*_x(n)$ as a natural generalization of usual word complexity. They defined a…

A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a…

Partial differential equations with random inputs have become popular models to characterize physical systems with uncertainty coming from, e.g., imprecise measurement and intrinsic randomness. In this paper, we perform asymptotic rare…