Related papers: A Hierarchy of Tree-Automatic Structures
It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
We show that, from a topological point of view, considering the Borel and the Wadge hierarchies, 1-counter B\"uchi automata have the same accepting power than Turing machines equipped with a B\"uchi acceptance condition. In particular, for…
We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.
The IA-automorphism group is the group of automorphisms of the free group $F_n$ that act trivially on the abelianization $F_n^{\mathrm{ab}}$. This group is in many ways analoguous to Torelli groups of surfaces and their higher dimensional…
Typed decorated trees are used by Bruned, Hairer and Zambotti to give a description of a renormalisation processon stochastic PDEs. We here study the algebraic structures on these objects: multiple prelie algebrasand related operads…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…
Muller and Schupp introduced the concept of context-free graphs (originating from Cayley graphs of context-free groups). These graphs are always tree-like (i.e. quasi-isometric to a tree) and in this paper we investigate the subclass of…
This paper establishes an explicit obstruction to constructing algebraic cycles from automorphic cohomology classes on Shimura varieties. We produce a rational Hodge class $\Omega_E$ in the intersection cohomology of the Baily-Borel…
The so-called Tits class, associated to an adjoint absolutely almost simple algebraic group, provides a cohomological obstruction for this group to admit an outer automorphism. If the group has inner type, this obstruction is the only one.…
Borel's stability and vanishing theorem gives the stable cohomology of $\mathrm{GL}(n,\mathbb{Z})$ with coefficients in algebraic $\mathrm{GL}(n,\mathbb{Z})$-representations. By combining the Borel theorem with the Hochschild-Serre spectral…
Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…
In the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $\Sigma^*$ where $\Sigma$ is a set of symbols (or the alphabet). Now, given a semiring $(\K,+,.)$, one can construct…
In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…
In this paper we consider the set ${\mathbb Z}^{\pm\omega}_{6}$ of two-way infinite words $\xi$ over the alphabet $\{0,1,2,3,4,5\}$ with the integer left part $\lfloor\xi\rfloor$ and the fractional right part $\{\xi\}$ separated by a radix…
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…
For a centerless group G, we can define its automorphism tower. We define G^{alpha} : G^0=G, G^{alpha +1}=Aut(G^alpha) and for limit ordinals G^delta=bigcup_{alpha < delta}G^alpha . Let tau_G be the ordinal when the sequence stabilizes.…
We address a natural question in noncommutative geometry, namely the rigidity observed in many examples, whereby noncommutative spaces (or equivalently their coordinate algebras) have very few automorphisms by comparison with their…
For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…