Related papers: Categorical polynomial entropy
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
The Pinsker subgroup of an abelian group with respect to an endomorphism was introduced in the context of algebraic entropy. Motivated by the nice properties and characterizations of the Pinsker subgroup, we generalize its construction in…
In this paper, we extend the concept of generalized entropy to uniform spaces, allowing computations beyond metrizable settings. We apply this to parabolic dynamics - systems with a unique fixed point uniformly attracting all compact…
Different notions of entropy play a fundamental role in the classical theory of dynamical systems. Unlike many other concepts used to analyze autonomous dynamics, both measure-theoretic and topological entropy can be extended quite…
A noncommutative projective variety is defined, after Artin and Zhang, by a graded coherent algebra A, where the category of coherent sheaves is the quotient qgr(A) of the category of finitely presented graded modules by the subcategory of…
The main purpose of this article is to provide a common generalization of the notions of a topological and Kolmogorov-Sinai entropy for arbitrary representations of discrete amenable groups on objects of (abstract) categories. This is…
Algebraically, entropy can be defined for abelian groups and their endomorphisms, and was latter extended to consider objects in a Flow category derived from abelian categories, such as $R\textit{-}Mod$ with $R$ a ring. Preradicals are…
In arXiv:1801.01238 a variation of Bowen's topological entropy that can be applied to the study of discontinuous semiflows on compact metric spaces was introduced. The main novetly is the use of certain family of pseudosemimetrics…
We consider oscillators evolving subject to a periodic driving force that dynamically entangles them, and argue that this gives the linearized evolution around periodic orbits in a general chaotic Hamiltonian dynamical system. We show that…
This paper investigates the relationship between categorical entropy and von Neumann entropy of quantum lattices. We begin by studying the von Neumann entropy, proving that the average von Neumann entropy per site converges to the logarithm…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
As defined by W. Thurston, the core entropy of a polynomial is the entropy of the restriction to its Hubbard tree. For each d >= 2, we study the core entropy as a function on the parameter space of polynomials of degree d, and prove it…
We define the class of multivariate group entropies as a novel set of information - theoretical measures, which extends significantly the family of group entropies. We propose new examples related to the "super-exponential" universality…
We define the monoidal category $(Poly_E,y,\triangleleft)$ of polynomials under composition in any category $E$ with finite limits, including both cartesian and vertical morphisms of polynomials, and generalize to this setting the Dirichlet…
In topological dynamics, the Gromov--Yomdin theorem states that the topological entropy of a holomorphic automorphism $f$ of a smooth projective variety is equal to the logarithm of the spectral radius of the induced map $f^*$. In order to…
We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…
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…
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…
One of the few accepted dynamical foundations of non-additive "non-extensive") statistical mechanics is that the choice of the appropriate entropy functional describing a system with many degrees of freedom should reflect the rate of growth…