English
Related papers

Related papers: Some solvable automaton groups

200 papers

We consider the rational subset membership problem for Baumslag-Solitar groups. These groups form a prominent class in the area of algorithmic group theory, and they were recently identified as an obstacle for understanding the rational…

Group Theory · Mathematics 2020-06-23 Michaël Cadilhac , Dmitry Chistikov , Georg Zetzsche

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

Group Theory · Mathematics 2014-09-01 Ievgen Bondarenko

Any non-residually finite Baumslag-Solitar group has a non-residually finite image in the abstract commensuration of a nonabelian free group. This gives a new proof (avoiding Britton's Lemma) of the classification of residually finite…

Group Theory · Mathematics 2020-03-18 Khalid Bou-Rabee , Samuel Young

For each Baumslag-Solitar group BS(m,n) (m,n nonzero integers), a totally disconnected, locally compact group, G_{m,n}, is constructed so that BS(m,n) is identified with a dense subgroup of G_{m,n}. The scale function on G_{m,n}, a…

Group Theory · Mathematics 2013-05-28 Murray Elder , George Willis

A generalized Baumslag-Solitar group (GBS group) is a finitely generated group $G$ which acts on a tree with all edge and vertex stabilizers infinite cyclic. We show that Out(G) either contains non-abelian free groups or is virtually…

Group Theory · Mathematics 2014-11-11 Gilbert Levitt

We give an exact formula for the number of normal subgroups of each finite index in the Baumslag-Solitar group BS(p,q) when p and q are coprime. Unlike the formula for all finite index subgroups, this one distinguishes different…

Group Theory · Mathematics 2007-08-21 J. O. Button

In this paper we classify Baumslag-Solitar groups up to commensurability. In order to prove our main result we give a solution to the isomorphism problem for a subclass of Generalised Baumslag-Solitar groups.

Group Theory · Mathematics 2019-10-08 Montserrat Casals-Ruiz , Ilya Kazachkov , Alexander Zakharov

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

Discrete Mathematics · Computer Science 2016-04-25 Volker Diekert , Alexei Miasnikov , Armin Weiß

We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.

Group Theory · Mathematics 2020-09-08 Yibei Li

Let $BS(1,n) =< a, b \ | \ aba^{-1} = b^n >$ be the solvable Baumslag-Solitar group, where $ n\geq 2$. It is known that BS(1,n) is isomorphic to the group generated by the two affine maps of the real line: $f_0(x) = x + 1$ and $h_0(x) = nx…

Dynamical Systems · Mathematics 2011-08-23 Nancy Guelman , Isabelle Liousse

Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually…

Group Theory · Mathematics 2015-01-08 Martin R. Bridson , Alan W. Reid

Symmetries of the finite Heisenberg group represent an important tool for the study of deeper structure of finite-dimensional quantum mechanics. As is well known, these symmetries are properly expressed in terms of certain normalizer. This…

Quantum Physics · Physics 2011-01-24 M. Korbelar , J. Tolar

A generalized Baumslag-Solitar (GBS) group is a finitely generated group acting on a tree with infinite cyclic edge and vertex stabilizers. We show how to determine effectively the rank (minimal cardinality of a generating set) of a GBS…

Group Theory · Mathematics 2019-06-07 Gilbert Levitt

In this article, we solve the twisted conjugacy problem for solvable Baumslag--Solitar groups $BS(n,1)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(n,1)$ and an automorphism $\varphi \in \Aut(BS(n,1))$, decides…

Group Theory · Mathematics 2025-08-07 Oorna Mitra , Mallika Roy , Enric Ventura

We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…

Group Theory · Mathematics 2022-06-13 Jordi Delgado , Enric Ventura

We prove that for any prime $p\geq 3$ the minimal exponential growth rate of the Baumslag-Solitar group $BS(1,p)$ and the lamplighter group $\mathcal{L}_p=(\mathbb{Z}/p\mathbb{Z})\wr \mathbb{Z}$ are equal. We also show that for $p=2$ this…

Group Theory · Mathematics 2015-06-12 Michelle Bucher , Alexey Talambutsa

In this paper we give necessary conditions on group presentations, with two generators and one relator, in order to be the group of a virtual knot diagram. Although those conditions are not enough, we use them to determine, completely,…

Group Theory · Mathematics 2015-11-12 J. G. Rodríguez , O. P. Salazar-Díaz , J. J. Mira

In this paper we give asymptotics for the conjugacy growth of the soluble Baumslag-Solitar groups $BS(1,k)$, $k\geq 2$, with respect to the standard generating set, by providing a complete description of geodesic conjugacy representatives.…

Group Theory · Mathematics 2019-08-16 Laura Ciobanu , Alex Evetts , Meng-Che "Turbo" Ho

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

Group Theory · Mathematics 2014-09-18 R. Grigorchuk , Y. Leonov , V. Nekrashevych , V. Sushchansky

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…

Group Theory · Mathematics 2007-05-23 Yair Glasner , Shahar Mozes