Related papers: On (bi)reversible automata generating lamplighter …

This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book Word Processing in Groups by Epstein et al. We present a counterexample to the lemma, and we reformulate the lemma to give a valid…

We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…

A homomorphism of an automaton ${\bf A}$ without outputs onto a subautomaton ${\bf B}$ of ${\bf A}$ is called a retract homomorphism if it leaves the elements of $B$ fixed. An automaton ${\bf A}$ is called a retractable automaton if, for…

In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.

Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in…

We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…

A dynamic logic ${\mathbf B}$ can be assigned to every automaton ${\mathcal A}$ without regard if ${\mathcal A}$ is deterministic or nondeterministic. This logic enables us to formulate observations on ${\mathcal A}$ in the form of composed…

An element $g$ of a group is called {\em reversible} if it is conjugate in the group to its inverse. In this paper we review some results about the structure of groups involving the reversible elements and we pose some questions about…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Let W be a Weyl group. We define a class of irreducible representations of W that we call antispecial. They are in bijection with the constructible representations of W. We define an oriented graph structure on the set of antispecial…

We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

In a recent paper Carot et al. considered carefully the definition of cylindrical symmetry as a specialisation of the case of axial symmetry. One of their propositions states that if there is a second Killing vector, which together with the…

The definition of conservative-irreversible functions is extended to smooth manifolds. The local representation of these functions is studied and reveals that not each conservative-irreversible function is given by the weighted product of…

We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular…

We show that a large class of divisible abelian $\ell$-groups (lattice ordered groups) of continuous functions is interpretable (in a certain sense) in the lattice of the zero sets of these functions. This has various applications to the…

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…

Let T be the homogeneous tree with degree and G a finitely generated group whose Cayley graph is T. The associated lamplighter group is the wreath product of the cyclic group of order r with G. For a large class of random walks on this…

We construct orbifolds of holomorphic lattice Vertex Operator Algebras for non-Abelian finite automorphism groups $G$. To this end, we construct twisted modules for automorphisms $g$ together with the projective representation of the…

We define an action of the braid group of a simple Lie algebra on the space of imaginary roots in the corresponding quantum affine algebra. We then use this action to determine an explicit condition for a tensor product of arbitrary…