Related papers: Symbolic extensions and uniform generators for top…
We study the thermodynamic formalism for suspension flows over countable Markov shifts with roof functions not necessarily bounded away from zero. We establish conditions to ensure the existence and uniqueness of equilibrium measures for…
In this paper, we extend a Ma\~n\'e's famous result on expansive homeomorphisms, originally presented in [17], to the setting of flows. Specifically, we provide a complete characterization of minimal expansive flows without fixed points on…
This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…
We give strongly aperiodic subshifts of finite type on every hyperbolic surface group; more generally, for each pair of expansive primitive symbolic substitution systems with incommensurate growth rates, we construct strongly aperiodic…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
In this article we study the regularity of the topological and metric entropy of partially hyperbolic flows with two-dimensional center direction. We show that the topological entropy is upper semicontinuous with respect to the flow, and we…
We consider impulsive semiflows defined on compact metric spaces and deduce a variational principle. In particular, we generalize the classical notion of topological entropy to our setting of discontinuous semiflows.
In this paper we propose a new supersymmetric extension of conformal mechanics. The Grassmannian variables that we introduce are the basis of the forms and of the vector-fields built over the symplectic space of the original system. Our…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
We consider a discrete dynamical system on a compact manifold M generated by a homeomorphism f. Let C = {M(i)} be a finite covering of M by closed cells. The symbolic image of a dynamical system is a directed graph G with vertices…
We address this work to investigate some statistical properties of symbolic sequences generated by a numerical procedure in which the symbols are repeated following a power law probability density. In this analysis, we consider that the sum…
New elementary, self-contained proofs are presented for the topological and the smooth classification theorems of linear flows on finite-dimensional normed spaces. The arguments, and the examples that accompany them, highlight the…
We generalize the study of higher-form-symmetries to theories with supersymmetry. Using a supergeometry formulation, we find that ordinary higher-form-symmetries nicely combine with supersymmetry to give rise to a much larger spectrum of…
Newton flows are dynamical systems generated by a continuous, desingularized Newton method for mappings from a Euclidean space to itself. We focus on the special case of meromorphic functions on the complex plane. Inspired by the analogy…
Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growing interest in the use of symbolic models as a tool for mitigating…
We formulate general rules for a coarse-graining of the dynamics, which we term `symbolic dynamics', of feedback networks with monotone interactions, such as most biological modules. Networks which are more complex than simple cyclic…
Given a renormalizable theory we construct the dilatation operator, in the sense of generator of RG flow of composite operators. The generator is found as a differential operator acting on the space of normal symbols of composite operators…
We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually…
We develop a method of driving a Markov processes through a continuous flow. In particular, at the level of the transition functions we investigate an approach of adding a first order operator to the generator of a Markov process, when the…
We develop a sound and complete graphical theory for discrete linear time-invariant dynamical systems. The graphical syntax, as in previous work, is closely related to the classical notion of signal flow diagrams, differently from previous…