Related papers: Large Semigroups of Cellular Automata

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…

We study the semigroup $\textbf{{ID}}_{\infty}$ of all partial isometries of the set of integers $\mathbb{Z}$. It is proved that the quotient semigroup $\textbf{{ID}}_{\infty}/\mathfrak{C}_{\textsf{mg}}$, where $\mathfrak{C}_{\textsf{mg}}$…

The geometry of inverse semigroups is a natural topic of study, motivated both from within semigroup theory and by applications to the theory of non-commutative $C^*$-algebras. We study the relationship between the geometry of an inverse…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

In this article, first we give two formulae for the delta invariant of a complex curve singularity that can be embedded as a ${\mathbb Q}$-Cartier divisor in a normal surface singularity with rational homology sphere link. Next, we consider…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…

We investigate properties which remain invariant under the action of quasi-M\"obius maps of quasi-metric spaces. A metric space is called doubling with constant D if every ball of finite radius can be covered by at most D balls of half the…

In the present paper, a series of results and examples that explore the structural features of H-commutative semigroups are provided. We also generalise a result of Isbell from commutative semigroups to H-commutative semigroups by showing…

We consider the preservation of the properties of automaticity and prefix-automaticity in Rees matrix semigroups over semigroupoids and small categories. Some of our results are new or improve upon existing results in the single-object case…

In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…

This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…

We describe a modified SIMD architecture suitable for single-chip integration of a large number of processing elements, such as 1,000 or more. Important differences from traditional SIMD designs are: a) The size of the memory per processing…

Let $G$ be a 1-connected, almost-simple Lie group over a local field and $\mathcal{S}$ a subsemigroup of $G$ with non-empty interior. The action of the regular hyperbolic elements in the interior of $\mathcal{S}$ on the flag manifold $G/P$…

Let $\Cal S$ be an abelian finitely generated semigroup of endomorphisms of a probability space $(\Omega, {\Cal A}, \mu)$, with $(T_1, ..., T_d)$ a system of generators in ${\Cal S}$. Given an increasing sequence of domains $(D_n) \subset…

The initial majority identification task is a fundamental test problem in cellular automaton research. To pass the test, an automaton must evolve to a uniform configuration consisting of the state that was in the majority for any initial…

It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. It has been shown that such patterns can occur when the alphabet is…

Cellular automata are computers, similar to Turing machines. The main difference is that Turing machines use a one-dimensional tape, whereas cellular automata use a two-dimensional grid. The best-known cellular automaton is the Game of…

Dualities play a central role in the study of quantum spin chains, providing insight into the structure of quantum phase diagrams and phase transitions. In this work we study categorical dualities, which are defined as bounded-spread…

We apply a theorem of Gel'fand, Goresky, MacPherson, and Serganova about matroid polytopes to study semistability of partial flags relative to a T-linearized ample line bundle of a flag space F = SL(n)/P where T is a maximal torus in SL(n)…