相关论文: Dynamics of $\mathscr{B}$-free systems generated b…
We consider gradient systems with an increasing potential that depends on a scalar parameter. As the parameter is varied, critical points of the potential can be eliminated or created through saddle-node bifurcations causing the system to…
Modifying Besicovitch's construction of a set $\mathcal{B}$ of positive integers whose set of multiples $\mathcal{M}_{\mathcal{B}}$ has no asymptotic density, we provide examples of such sets $\mathcal{B}$ for which…
Let $\mathcal B\subseteq\mathbb N$ be a primitive set. We complement results on heredity of the $\mathcal B$-free subshift $X_\eta$ from [arxiv:1509.08010] in two directions: In the proximal case we prove that a subshift $X_\varphi$, which…
For $ \mathscr{B} \subseteq \mathbb{N} $, the $ \mathscr{B} $-free subshift $ X_{\eta} $ is the orbit closure of the characteristic function of the set of $ \mathscr{B} $-free integers. We show that many results about invariant measures and…
An idea that became unavoidable to study zero entropy symbolic dynamics is that the dynamical properties of a system induce in it a combinatorial structure. An old problem addressing this intuition is finding a structure theorem for…
In this work we consider an ensemble of random $\mathbb{Z}^d$-shifts of finite type ($\mathbb{Z}^d$-SFTs) and prove several results concerning the behavior of typical systems with respect to emptiness, entropy, and periodic points. These…
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
In this paper, we extend the notion of microstate free entropy to the bi-free setting. In particular, using the bi-free analogue of random matrices, microstate bi-free entropy is defined. Properties essential to an entropy theory are…
Dynamic properties of fermionic systems, like contollability, reachability, and simulability, are investigated in a general Lie-theoretical frame for quantum systems theory. Observing the parity superselection rule, we treat the fully…
For bilinear control systems in $\mathbb{R}^d$ we prove, under an accessibility hypothesis, the existence of a nontrivial compact set $D\subset\mathbb{R}^d$ satisfying $\mathcal{O}_t(D)=e^{tR}D$ for all $t>0$, where $R\in\mathbb{R}$ is a…
We prove that on B-free subshifts, with B satisfying the Erd\"os condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.
We describe a new class of groups of Burnside type, giving a procedure transforming an arbitrary non-free minimal action of the dihedral group on a Cantor set into an orbit-equivalent action of an infinite finitely generated periodic group.…
A plethora of natural, artificial and social complex systems exists which violate the basic hypothesis (e.g., ergodicity) of Boltzmann-Gibbs (BG) statistical mechanics. Many of such cases can be satisfactorily handled by introducing…
Nilsystems are a natural generalization of rotations and arise in various contexts, including in the study of multiple ergodic averages in ergodic theory, in the structural analysis of topological dynamical systems, and in asymptotics for…
In this paper we characterize tame dynamical systems and functions in terms of eventual non-sensitivity and eventual fragmentability. As a notable application we obtain a neat characterization of tame subshifts $X \subset \{0,1\}^{\mathbb…
The existence of the {\em typical set} is key for data compression strategies and for the emergence of robust statistical observables in macroscopic physical systems. Standard approaches derive its existence from a restricted set of…
The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…
In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…
The free central-limit theorem, a fundamental theorem in free probability, states that empirical averages of freely independent random variables are asymptotically semi-circular. We extend this theorem to general dynamical systems of…
Maximum-entropy ensembles are key primitives in statistical mechanics from which thermodynamic properties can be derived. Over the decades, several approaches have been put forward in order to justify from minimal assumptions the use of…