Related papers: Some solvable automaton groups

The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is…

We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…

A linear group is called unisingular if every element of it has eigenvalue 1. A certain aspect of the theory of abelian varieties requires the knowledge of unisingular irreducible subgroups of the symplectic groups over the field of two…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

In this paper, we consider certain descending filtrations of the $\mathrm{SL}(m,\C)$-representation algebras of free groups and free abelian groups. By using it, we introduce analogs of the Johnson homomorphisms of the automorphism groups…

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

We compute the $p$-primary components of the linking pairings of orientable 3-manifolds admitting a fixed-point free $S^1$-action. Using this, we show that any non-singular linking pairing on a finite abelian group with homogeneous…

For every positive integer $n$, we construct, using algebraic groups, an infinite family of irreducible algebraic varieties $X$,whose automorphism group ${\rm Aut}(X)$ contains the automorphism group ${\rm Aut}(F_n)$ of a free group $F_n$…

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

We show that Baumslag-Solitar groups are virtually 2-avoidable, that is, they admit finite index subgroup whose first homology is devoid of $\mathbb{Z}_2$ summand. We also prove virtual 2-avoidability for some other classes of one-relator…

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to…

Suzuki recently gave constructions of non-discrete examples of locally compact C*-simple groups and Raum showed C*-simplicity of the relative profinite completions of the Baumslag-Solitar groups by using Suzuki's results. We extend this…

The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this…

For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an element of the group such that the Turing machine stops if, and…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

A classical result of Schreier states that nontrivial finitely generated normal subgroups of free groups are of finite index, that is, free groups can only quotient to finite groups with finitely generated kernel. In this note we extend…

We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.

In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $\Gamma$ is a finite graph which is the…

We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…