相关论文: Algebraic Entropy for lattice equations

Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…

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 define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…

Let $\Lambda$ be a lattice of rank $n$. A Lie algebra on the lattice $\Lambda$ is a Lie algebra ${\cal L}=\oplus_{\lambda\in\Lambda}\,{\cal L}_{\lambda}$ such that $\dim\,{\cal L}_\lambda=1$ for all $\lambda$. In this article, we classify…

Classification is a machine learning method used in many practical applications: text mining, handwritten character recognition, face recognition, pattern classification, scene labeling, computer vision, natural langage processing. A…

The problems of conditional entropy's definition and the formula to compute conditional entropy are analyzed from various perspectives, and the corrected computing formula is presented. Examples are given to prove the conclusion that…

Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative…

Entropy has emerged as a dynamic, interdisciplinary, and widely accepted quantitative measure of uncertainty across different disciplines. A unified understanding of entropy measures, supported by a detailed review of their theoretical…

Predictive inference requires balancing statistical accuracy against informational complexity, yet the choice of complexity measure is usually imposed rather than derived. We treat econometric objects as predictive rules, mappings from…

Leibniz algebras are a non-anticommutative version of Lie algebras. They play an important role in different areas of mathematics and physics and have attracted much attention over the last thirty years. In this paper we investigate whether…

Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the…

The translated logarithmic Lambert function is defined and basic analytic properties of the function are obtained including the derivative, integral, Taylor series expansion, real branches and asymptotic approximation of the function.…

The configurational entropy is one of the most important thermodynamic quantities characterizing supercooled liquids approaching the glass transition. Despite decades of experimental, theoretical, and computational investigation, a widely…

We overview the notion of entropy in thermodynamics. We start from the smooth case using differential forms on the manifold, which is the natural language for thermodynamics. Then the axiomatic definition of entropy as ordering on a set…

Entanglement entropy has proven to be an extremely useful concept in quantum field theory. Gauge theories are of particular interest, but for these systems the entanglement entropy is not clearly defined because the physical Hilbert space…

The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…

The Gibbs entropy of a microcanonical network ensemble is the logarithm of the number of network configurations compatible with a set of hard constraints. This quantity characterizes the level of order and randomness encoded in features of…

We consider in this paper the problem of computing the entropy of a braid. We recall its definition and construct, for each braid, a sequence of real numbers, whose limit is its entropy. We state one conjecture about the convergence speed,…

We define the notion of localizable property for a dynamical system. Then we survey three properties of complexity and relate how they are known to be typical among differentiable dynamical systems. These notions are the fast growth of the…

It is shown that if (M,phi,alpha) is a W*-dynamical system with M a type I von Neumann algebra then the entropy of alpha w.r.t. phi equals the entropy of the restriction of alpha to the center of M. If furthermore (N,psi,beta) is a…