相关论文: Algebraic Entropy for lattice equations
Classical chaos is often characterized as exponential divergence of nearby trajectories. In many interesting cases these trajectories can be identified with geodesic curves. We define here the entropy by $S = \ln \chi (x)$ with $\chi(x)$…
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…
We define an entropy based on a chosen governing probability distribution. If a certain kind of measurements follow such a distribution it also gives us a suitable scale to study it with. This scale will appear as a link function that is…
A general formula for the entropy of stationary black holes in Lovelock gravity theories is obtained by integrating the first law of black hole mechanics, which is derived by Hamiltonian methods. The entropy is not simply one quarter of the…
This paper is devoted to the complexity analysis of a particular property, called "algebraic robustness" owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
We compute the low-temperature configurational entropy of a two-dimensional supercooled liquid. Our method, based on a higher-dimensional version of the Grassberger--Procaccia algorithm, can be implemented in a manner that is entirely…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
Standard Quantum Mechanics, although successful in terms of calculating and predicting results, is inherently difficult to understand and can suffer from misinterpretation. Entropic Dynamics is an epistemic approach to quantum mechanics…
A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…
Entropy, its production, and its change in a dynamical system can be understood from either a fully stochastic dynamic description or from a deterministic dynamics exhibiting chaotic behavior. By taking the former approach based on the…
Entropy has been a common index to quantify the complexity of time series in a variety of fields. Here, we introduce increment entropy to measure the complexity of time series in which each increment is mapped into a word of two letters,…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
We define the indefinite logarithm [log x] of a real number x>0 to be a mathematical object representing the abstract concept of the logarithm of x with an indeterminate base (i.e., not specifically e, 10, 2, or any fixed number). The…
Formalising the confrontation of opinions (models) to observations (data) is the task of Inferential Statistics. Information Theory provides us with a basic functional, the relative entropy (or Kullback-Leibler divergence), an asymmetrical…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
The novel concept of quantum logical entropy is presented and analyzed. We prove several basic properties of this entropy with regard to density matrices. We hereby motivate a different approach for the assignment of quantum entropy to…
A given question can be defined in terms of the set of statements or assertions that answer it. Application of logical inference to these sets of assertions allows one to derive the logic of inquiry among questions. There are interesting…
Necessary and sufficient conditions for the symbolic dynamics of a Lorenz map to be fully embedded in the symbolic dynamics of a piecewise continuous interval map are given. As an application of this result, we describe a new algorithm for…
We give piecewise affine maps on the unit cube whose symbolic representation is the Dyck shift. This leads to a different way of verifying the chaotic nature of this system, including the computation of entropy.