Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.11630

Cellular Automata on Racks

Naqeeb ur Rehman·Muhammad Khuram Shahzad
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we initiate the study of cellular automata on racks. A rack $R$ is a set with a self-distributive binary operation. The rack $R$ acts on the set $A^R$ of configurations from $R$ to a set $A$. We define the cellular automaton on a rack $R$ as a continuous self-mapping of $A^R$ defined from a system of local rules. The cellular automata on racks do not commute with the rack action. However, under certain conditions, the cellular automata on racks do commute with the rack action. We study the equivariant cellular automta (which commute with the rack action) on racks and prove several properties of these cellular automata including the analog of Curtis-Hedlund's theorem for cellular automata on groups.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Naqeeb ur Rehman, Muhammad Khuram Shahzad. 2018-07-30. Cellular Automata on Racks. https://arxiv.org/abs/1807.11630

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗