Related papers: On the Induction Operation for Shift Subspaces and…
We study expansive dynamical systems in the setting of distributive lattices and their automorphisms, the usual notion of expansiveness for a homeomorphism of a compact metric space being the particular case when the lattice is the topology…
If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…
We propose an abelian categorification of $\hat{Z}$-invariants for Seifert $3$-manifolds. First, we give a recursive combinatorial derivation of these $\hat{Z}$-invariants using graphs with certain hypercubic structures. Next, we consider…
Let $G$ be a finitely generated amenable group. We study the space of shifts on $G$ over a given finite alphabet $A$. We show that the zero entropy shifts are generic in this space, and that more generally the shifts of entropy $c$ are…
We characterize those regular, holomorphic or formal maps into the orbit space $V/G$ of a complex representation of a finite group $G$ which admit a regular, holomorphic or formal lift to the representation space $V$. In particular, the…
Invertible cellular automata are useful as models of physical systems with microscopically revesible dyanmics. There are several well-understood ways to construct them: partitioning rules, second-order rules, and alternating-grid rules. We…
This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes. These results fall into the general domain of logic-based approaches to complexity theory and so-called implicit computational…
We describe $\omega$-limit sets of completely positive (CP) maps over finite-dimensional spaces. In such sets and in its corresponding convex hulls, CP maps present isometric behavior and the states contained in it commute with each other.…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
Discussed is a model of collective and internal degrees of freedom with kinematics based on affine group and its subgroups. The main novelty in comparison with the previous attempts of this kind is that it is not only kinematics but also…
We extend the lift application for automorphic induction defined by an identity of characters to all elliptic representations.
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…
`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
We develop a sound and complete graphical theory for discrete linear time-invariant dynamical systems. The graphical syntax, as in previous work, is closely related to the classical notion of signal flow diagrams, differently from previous…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
Explaining and reasoning about processes which underlie observed black-box phenomena enables the discovery of causal mechanisms, derivation of suitable abstract representations and the formulation of more robust predictions. We propose to…
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations…