Related papers: Around Gromov's injectivity lemma and applications…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. They are studied both from the…
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of…
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non…
The subgroup induction property is a property of self-similar groups acting on rooted trees introduced by Grigorchuk and Wilson in 2003 that appears to have strong implications on the structure of the groups possessing it. It was for…
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…
We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is $injectively$ $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in\mathcal C$ containing $X$ as a subsemigroup. Let $\mathsf{T_{\!2}S}$ (resp.…
This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…
Let $\Gamma$ be a discrete group and let $f \in \ell^1(\Gamma)$. We observe that if the natural convolution operator $\rho_f:\ell^{\infty}(\Gamma)\to \ell^{\inf ty}(\Gamma)$ is injective, then f is invertible in $\ell^1(\Gamma)$. Our proof…
Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…
In this article, we prove that a semidirect product of a locally finite group with a surjunctive group is also surjunctive. We also prove that a surjunctive-by-locally finite group is again surjunctive.
Semigroup actions and their invertible extensions are discussed. First, we develop a theory of natural extensions for continuous actions of countable, embeddable semigroups. Second, we demonstrate that not every surjective such action of a…
This paper is about topological dynamics of cellular automata on finitely generated groups. We tackle the problem of determining for which group sensitivity to initial conditions is equivalent to the absence of equicontinuity points…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…
The notion of essential submodules and essential extensions of modules are extended to groups (typically nonabelian), and several necessary and sufficient conditions for a group to possess a proper essential subgroup are investigated.…