Related papers: Real Arnold complexity versus real topological ent…
Duality is an indispensable tool for describing the strong-coupling dynamics of gauge theories. However, its actual realization is often quite subtle: quantities such as the partition function can transform covariantly, with degrees of…
In this work, we develop a generalisation of the thermal entropy to complex inverse temperatures, which we call the thermal pseudo-entropy. We show that this quantity represents the pseudo-entropy of the transition matrix between…
Let $G$ be the group $\mathbb{Z}^d$ or the monoid $\mathbb{N}^d$ where $d$ is a positive integer. Let $X$ be a subshift over $G$, i.e., a closed and shift-invariant subset of $A^G$ where $A$ is a finite alphabet. We prove that the…
The classical Arnold-Liouville theorem describes the geometry of an integrable Hamiltonian system near a regular level set of the moment map. Our results describe it near a nondegenerate singular level set: a tubular neighborhood of a…
Arborified multiple zeta values are a generalization of multiple zeta values associated with rooted trees. There are two types of decorated rooted trees, corresponding respectively to the series and the integral expressions. Manchon…
We propose to examine the predictability and the complexity characteristics of the Standard&Poor500 dynamics behaviors in a coarse-grained way using the symbolic dynamics method and under the prism of the Information theory through the…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
We introduce the notion of a standard weighted graph and show that every weighted graph has an essentially unique standard model. Moreover we classify birational transformations between such models. Our central result shows that these are…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
We give two constructions of functorial topological realizations for schemes of finite type over the field $\mathbb{C}(\!(t)\!)$ of formal Laurent series with complex coefficients, with values in the homotopy category of spaces over the…
Packing topological entropy is a dynamical analogy of the packing dimension, which can be viewed as a counterpart of Bowen topological entropy. In the present paper, we will give a systematically study to the packing topological entropy for…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. The reasons for the increasing popularity of this entropy in…
One develops {\em ab initio} the theory of rational/birational maps over reduced, but not necessarily irreducible, projective varieties in arbitrary characteristic. A numerical invariant of a rational map is introduced, called the Jacobian…
Prediction of events is the challenge in many different disciplines, from meteorology to finance; the more this task is difficult, the more a system is {\it complex}. Nevertheless, even according to this restricted definition, a general…
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…
This survey paper is aimed to describe a relatively new branch of symbolic dynamics which we call Arithmetic Dynamics. It deals with explicit arithmetic expansions of reals and vectors that have a "dynamical" sense. This means precisely…
In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two…
We consider actions of a tileable amenable group $\Gamma$ on a topological space $X$. For a continuous function on $X$, we define the entropy of the number of homologically detectable critical point of the average of that function over…
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…