Related papers: Amenability of Bounded Automata Groups on Infinite…
It is shown that the restriction of the action of any group with finite orbit on the minimal sets of dendrites is equicontinuous. Consequently, we obtain that the action of any amenable group and Thompson group on dendrite restricted on…
In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…
We study fluctuations of ergodic averages generated by actions of amenable groups. In the setting of an abstract ergodic theorem for locally compact second countable amenable groups acting on uniformly convex Banach spaces, we deduce a…
In this short note we study the entropy for algebraic actions of certain amenable groups. The possible values for this entropy are studied. Various fundamental results about certain classes of amenable groups are reproved using elementary…
Let Gamma be a finitely generated, amenable group. Using an idea of E Ghys, we prove that if Gamma has a nontrivial, orientation-preserving action on the real line, then Gamma has an infinite, cyclic quotient. (The converse is obvious.)…
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…
We define and study notions of amenability and skew-amenability of continuous actions of topological groups on compact topological spaces. Our main motivation is the question under what conditions amenability of a topological group passes…
We introduce the notion of Zimmer amenability for actions of discrete quantum groups on von Neumann algebras. We prove generalizations of several fundamental results of the theory in the noncommutative case. In particular, we give a…
We describe in terms of automata theory the automatic actions with post-critically finite limit space. We prove that these actions are precisely the actions by bounded automata and that any self-similar action by bounded automata is…
We investigate unitarisability of groups by looking at actions on the cone of positive invertible operators of a Hilbert space. This way, we give a geometric prove to a result by Gilles Pisier on the existence of some universal constants…
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…
The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
We consider the amenability of groupoids $G$ equipped with a group valued cocycle $c:G\to Q$ with amenable kernel $c^{-1}(e)$. We prove a general result which implies, in particular, that $G$ is amenable whenever $Q$ is amenable and if…
We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.
We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.
This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure. The goals…
For each $p\geq 1$, the star automaton group $\mathcal{G}_{S_p}$ is an automaton group which can be defined starting from a star graph on $p+1$ vertices. We study Schreier graphs associated with the action of the group $\mathcal{G}_{S_p}$…
We introduce the notion of tracial amenability for actions of discrete groups on unital, tracial C$^*$-algebras, as a weakening of amenability where all the relevant approximations are done in the uniform trace norm. We characterize tracial…
We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If…