Related papers: Infinite words and universal free actions
We consider actions of completely metrisable groups on simplicial trees in the context of the Bass--Serre theory. Our main result characterises continuity of the amplitude function corresponding to a given action. Under fairly mild…
Let $\Gamma$ be a non-commutative free group on finitely many generators. In a previous work two of the authors have constructed the class of multiplicative representations of $\Gamma$ and proved them irreducible as representation of…
This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…
We introduce a quantitative notion of lawlessness for finitely generated groups, encoded by the "lawlessness growth function" $\mathcal{A}_{\Gamma} : \mathbb{N} \rightarrow \mathbb{N}$. We show that $\mathcal{A}_{\Gamma}$ is bounded iff…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…
Given a square matrix with elements in the group-ring of a group, one can consider the sequence formed by the trace (in the sense of the group-ring) of its powers. We prove that the corresponding generating series is an algebraic…
By combining R{\o}rdam's construction and the author's previous construction, we provide the first examples of amenable actions of non-amenable groups on simple separable nuclear C*-algebras that are neither stably finite nor purely…
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…
Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well.…
The superextension $\lambda(X)$ of a set $X$ consists of all maximal linked families on $X$. Any associative binary operation $*: X\times X \to X$ can be extended to an associative binary operation $*:…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
Let $\Gamma$ be a finite rank subgroup of $\overline{\mathbb{Q}}^*$. We prove that the multiplicative group of the field generated by all elements in the divisible hull of $\Gamma$, is free abelian modulo this divisible hull. This proves…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
We show that many countable groups acting on trees, including free products of infinite countable groups and surface groups, are isomorphic to dense subgroups of isometry groups of bounded Urysohn spaces. This extends previous results of…
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…
Let G be a real semisimple Lie group with no compact factors and finite centre, and let $\Lambda$ be a lattice in G. Suppose that there exists a homomorphism from $\Lambda$ to the outer automorphism group of a right-angled Artin group…
Let $T_1$ and $T_2$ be homogeneous trees of even degree $\ge 4$. A BM group $\Gamma$ is a torsion free discrete subgroup of $\aut (T_1) \times \aut (T_2)$ which acts freely and transitively on the vertex set of $T_1 \times T_2$. This…