English
Related papers

Related papers: The Myhill property for cellular automata on amena…

200 papers

We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that…

Combinatorics · Mathematics 2009-12-17 Laurent Bartholdi

For linear non-uniform cellular automata (NUCA) over an arbitrary universe, we introduce and investigate their dual linear NUCA. Generalizing results for linear CA, we show that dynamical properties namely pre-injectivity, resp.…

Dynamical Systems · Mathematics 2022-08-30 Xuan Kien Phung

This paper explores cellular automata (CA) constructed from Yang-Baxter maps over finite fields $F_{2^n}$. We define $R$-matrices using a map $f$ on $F_{2^n}$ and establish necessary and sufficient conditions for $f$ to satisfy the…

Exactly Solvable and Integrable Systems · Physics 2026-02-20 Aoi Araoka , Tetsuji Tokihiro

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

Commutative Algebra · Mathematics 2020-06-09 Alberto Dennunzio , Enrico Formenti , Darij Grinberg , Luciano Margara

Gottschalk's surjunctivity conjecture for a group $G$ states that it is impossible for cellular automata (CA) over the universe $G$ with finite alphabet to produce strict embeddings of the full shift into itself. A group universe $G$…

Dynamical Systems · Mathematics 2026-03-17 Xuan Kien Phung

Nonlinear cellular automata are extensively used in simulations, image processing, cryptography, and so on. The determination of their fundamental properties, injectivity and surjectivity, related to information loss during the evolution,…

Data Structures and Algorithms · Computer Science 2024-07-29 Chen Wang , Junchi Ma , Defu Lin , Weilin Chen , Chao Wang

Let us consider a linear control system \Sigma on a connected Lie group G. It is known that the accessibility set A from the identity e is in general not a semigroup. In this article we associate a new algebraic object S to \Sigma which…

Dynamical Systems · Mathematics 2016-07-12 Victor Ayala , Adriano da Silva

Gauge-invariance is a fundamental concept in physics---known to provide the mathematical justification for all four fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts, directly in…

Formal Languages and Automata Theory · Computer Science 2018-07-03 Pablo Arrighi , Giuseppe Di Molfetta , Nathanaël Eon

We completely determine all semigroup varieties satysfiyng a permutational identity of length 3 that are modular elements of the lattice of all semigroup varieties. Using this result, we provide an example of a semigroup variety that is a…

Group Theory · Mathematics 2017-09-12 Dmitry V. Skokov , Boris M. Vernikov

We prove that a commutative parasemifield S is additively idempotent provided that it is finitely generated as a semiring. Consequently, every proper commutative semifield T that is finitely generated as a semiring is either additively…

Commutative Algebra · Mathematics 2019-10-08 Vítězslav Kala , Miroslav Korbelář

The aim of this paper is to show that the automorphism and isometry groups of the suspension of $B(H)$, $H$ being a separable infinite dimensional Hilbert space, are algebraically reflexive. This means that every local automorphism,…

Functional Analysis · Mathematics 2016-09-07 Lajos Molnar , M. Gyory

Topological transitivity is a fundamental notion in topological dynamics and is widely regarded as a basic indicator of global dynamical complexity. For general cellular automata, topological transitivity is known to be undecidable. By…

Formal Languages and Automata Theory · Computer Science 2026-01-26 Niccolò Castronuovo , Alberto Dennunzio , Luciano Margara

For a group $G$ and a set $A$, let $\text{End}(A^G)$ be the monoid of all cellular automata over $A^G$, and let $\text{Aut}(A^G)$ be its group of units. By establishing a characterisation of surjunctuve groups in terms of the monoid…

Group Theory · Mathematics 2023-01-27 Alonso Castillo-Ramirez

We study the computational complexity of determining whether a cellular automaton is sensitive to initial conditions. We show that this problem is $\Pi^0_2$-complete in dimension 1 and $\Sigma^0_3$-complete in dimension 2 and higher. This…

Dynamical Systems · Mathematics 2025-05-06 Tom Favereau , Ville Salo

Given a Lie group $G$ with finitely many components and a compact Lie group A which acts on $G$ by automorphisms, we prove that there always exists an A-invariant maximal compact subgroup K of G, and that for every such K, the natural map…

Group Theory · Mathematics 2009-04-21 Jinpeng An , Ming Liu , Zhengdong Wang

We show that every isometric action on a Cantor set is conjugate to an inverse limit of actions on finite sets; and that every isometric action by a finitely generated amenable group is residually finite.

Dynamical Systems · Mathematics 2022-04-25 Samantha Pilgrim

Let $S$ be a subset of a amenable group $G$ such that $e\in S$ and $S^{-1}=S$. The main result of the paper states that if the Cayley graph of $G$ with respect to $S$ has a certain combinatorial property, then every positive definite…

Functional Analysis · Mathematics 2019-08-15 M. Bakonyi , D. Timotin

Hyphae within the mycelia of the ascomycetous fungi are compartmentalised by septa. Each septum has a pore that allows for inter-compartmental and inter-hyphal streaming of cytosol and even organelles. The compartments, however, have…

Emerging Technologies · Computer Science 2020-06-24 Eric Goles , Michail-Antisthenis Tsompanas , Andrew Adamatzky , Martin Tegelaar , Han A. B. Wosten , Genaro J. Martinez

For positive $C_0$-semigroups $S$ and $T$ on a Banach lattice such that $S(t) \le T(t)$ for all times $t$, we prove that analyticity of $T$ implies analyticity of $S$. This answers an open problem posed by Arendt in 2004. Our proof is based…

Functional Analysis · Mathematics 2025-02-20 Jochen Glück

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

Group Theory · Mathematics 2022-11-01 Takao Yuyama
‹ Prev 1 8 9 10 Next ›