English
Related papers

Related papers: A converse to Moore's theorem on cellular automata

200 papers

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

Dynamical Systems · Mathematics 2017-01-24 Nikita Moriakov

Recall that a definable group is `definably amenable' if it admits a translation-invariant Keisler measure. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a…

Logic · Mathematics 2025-11-20 Atticus Stonestrom

Let $K$ be a locally compact field of characteristic 0. Let $G$ be a linear algebraic group defined over $K$, acting algebraically on an algebraic variety $V$. We prove that the action of $G(K)$ (the group of $K$-rational points of $G$) on…

Dynamical Systems · Mathematics 2024-05-13 Alain J. Valette

It is proved that a discrete group $G$ is amenable if and only if for every unitary representation of $G$ in an infinite-dimensional Hilbert space $\cal H$ the maximal uniform compactification of the unit sphere $\s_{\cal H}$ has a…

Functional Analysis · Mathematics 2009-10-31 Vladimir Pestov

Let $M$ be a cancellative monoid. It is known~\cite{Ta54} that if $M$ is left amenable then the monoid ring $K[M]$ satisfies Ore condition, that is, there exist nontrivial common right multiples for the elements of this ring.…

Group Theory · Mathematics 2021-01-05 Victor Guba

We observe that a Polish group $G$ is amenable if and only if every continuous action of $G$ on the Hilbert cube admits an invariant probability measure. This generalizes a result of Bogatyi and Fedorchuk. We also show that actions on the…

Group Theory · Mathematics 2011-08-08 Yousef Al-Gadid , Brice R. Mbombo , Vladimir G. Pestov

Let $G$ be a subgroup of a discrete (countable) group $\Gamma$. We introduce a notion of relative inner amenability of $G$ in $\Gamma$, we prove some equivalent conditions and provide examples as well as counter-examples. We also discuss…

Group Theory · Mathematics 2013-12-03 Paul Jolissaint

We establish a connection between percolation on the Cayley graphs of a group and the dynamical diversity of cellular automata on that group. Specifically, we demonstrate that Gilman's dichotomy between equicontinuity and sensitivity with…

Dynamical Systems · Mathematics 2024-11-15 Sebastián Barbieri , Felipe García-Ramos , Siamak Taati

We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…

Formal Languages and Automata Theory · Computer Science 2025-07-15 Niccolo' Castronuovo , Alberto Dennunzio , Luciano Margara

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

Group Theory · Mathematics 2022-05-16 Karol Duda

We prove that amenability of a discrete group is equivalent to dimension flatness of certain ring inclusions naturally associated with measure preserving actions of the group. This provides a group-measure space theoretic solution to a…

Group Theory · Mathematics 2013-05-16 David Kyed , Henrik Densing Petersen

We show that a certain tiling property (which directly implies the pointwise ergodic theorem) holds for pmp actions of amenable groups along increasing Tempelman F{\o}lner sequences, thus providing a short and combinatorial proof of the…

Dynamical Systems · Mathematics 2020-09-08 Jonathan Boretsky , Jenna Zomback

We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…

Logic · Mathematics 2025-11-18 Ehud Hrushovski , Krzysztof Krupiński , Anand Pillay

In this paper, we prove that there is a strongly universal cellular automaton on the pentagrid with six states. For each cell c, Moore neighbourhood consists of the cells which share a vertex with c. Moreover, the rules are rotation…

Cellular Automata and Lattice Gases · Physics 2023-09-20 Maurice Margenstern

Let G be a compact connected Lie group. We prove that the Fourier algebra A(G) is weakly amenable if and only if G is abelian.

Functional Analysis · Mathematics 2007-05-23 R. J. Plymen

We prove that the C*-algebra of a second-countable, \'etale, amenable groupoid is simple if and only if the groupoid is topologically principal and minimal. We also show that if G has totally disconnected unit space, then the associated…

Operator Algebras · Mathematics 2013-10-10 Jonathan H. Brown , Lisa Orloff Clark , Cynthia Farthing , Aidan Sims

We show that the amenability of a locally compact group $G$ is equivalent to a factorization property of $VN(G)$ which is given by $ VN(G) = <VN(G)^*VN(G)>$. This answer partially two problems proposed by Z. Hu and M. Neufang in their…

Operator Algebras · Mathematics 2011-08-16 Denis Poulin

We prove that if an amenable operator algebra is nearly contained in a complemented dual operator algebra, then it can be embedded inside this dual operator algebra via a similarity. The proof relies on a B.E. Johnson Theorem on…

Operator Algebras · Mathematics 2014-02-26 Jean Roydor

In this paper, we give another two characterizations of relative amenability on finite von Neumann algebras, one of which can be thought of as an analogue of injective operator systems. As an application, we prove a stable property of…

Operator Algebras · Mathematics 2018-07-06 Xiaoyan Zhou , Junsheng Fang

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…

Formal Languages and Automata Theory · Computer Science 2023-08-09 Alberto Dennunzio , Enrico Formenti , Luciano Margara
‹ Prev 1 4 5 6 7 8 10 Next ›