Related papers: Generating Simplicial Complexes
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
In this expository paper we describe an unifying approach for many known entropies in Mathematics. First we recall the notion of semigroup entropy h_S in the category S of normed semigroups and contractive homomorphisms, recalling also its…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
In this article, we define amorphic complexity for actions of locally compact $\sigma$-compact amenable groups on compact metric spaces. Amorphic complexity, originally introduced for $\mathbb Z$-actions, is a topological invariant which…
We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…
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…
This study introduces the syntropy function ($S_N$) and expectancy function ($E_N$), derived from the novel function $\phi$, to provide a refined perspective on complexity, extending beyond conventional entropy analysis. $S_N$ is designed…
The universal concept of complexity by the dynamic redundance paradigm and the ensuing concept of extended dynamic fractality (physics/9806002) are applied here to higher levels of complexity corresponding to living systems. After recalling…
We have earlier constructed a generalized entropy concept to show the direction of time in an evolution following from a Markov generator. In such a dynamical system, the entity found changes in a monotonic way starting from any initial…
In this paper we extend the notion of a continuous bundle random dynamical system to the setting where the action of $\R$ or $\N$ is replaced by the action of an infinite countable discrete amenable group. Given such a system, and a…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
Let $(X,G)$ be a minimal equicontinuous dynamical system, where $X$ is a compact metric space and $G$ some topological group acting on $X$. Under very mild assumptions, we show that the class of regular almost automorphic extensions of…
Entropic dynamics is a framework for defining dynamical systems that is aligned with the principles of information theory. In an entropic dynamics model for motion on a statistical manifold, we find that the rate of changes for expected…
We show that the concept of topological order, introduced to describe ordered quantum systems which cannot be classified by broken symmetries, also applies to classical systems. Starting from a specific example, we show how to use pure…
We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…
Simplicial complexes are generalized network structures able to encode interactions occurring between more than two nodes. Simplicial complexes describe a large variety of complex interacting systems ranging from brain networks, to social…
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…
simpcomp is an extension to GAP, the well known system for computational discrete algebra. It allows the user to work with simplicial complexes. In the latest version, support for simplicial blowups and discrete normal surfaces was added,…
Recently Lewis Bowen introduced a notion of entropy for measure-preserving actions of a countable sofic group on a standard probability space admitting a generating partition with finite entropy. By applying an operator algebra perspective…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…