English
Related papers

Related papers: On groups with EDT0L word problem

200 papers

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

We define a class $\mathcal{U}$ of solvable groups of finite abelian section rank which includes all such groups that are virtually torsion-free as well as those that are finitely generated. Assume that $G$ is a group in $\mathcal{U}$ and…

Group Theory · Mathematics 2014-12-30 Karl Lorensen

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. In particular, Olshanskii gave an example of such…

Group Theory · Mathematics 2023-07-28 Matteo Pintonello , Pavel Shumyatsky

The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological…

Group Theory · Mathematics 2007-05-23 S. Kaplan , M. Teicher

We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.

Group Theory · Mathematics 2018-09-05 Maurice Chiodo , Rishi Vyas

We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…

Group Theory · Mathematics 2018-04-26 Nikolai Gordeev , Boris Kunyavskii , Eugene Plotkin

We prove that every finitely generated, residually finite group $G$ embeds into a finitely generated perfect branch group $\Gamma$ such that many properties of $G$ are preserved under this embedding. Among those are the properties of being…

Group Theory · Mathematics 2024-03-06 Steffen Kionke , Eduard Schesler

This paper explores the nature of the solution sets of systems of equations in virtually abelian groups. We view this question from two angles. From a formal language perspective, we prove that the set of solutions to a system of equations…

Group Theory · Mathematics 2022-02-01 Alex Evetts , Alex Levine

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…

Group Theory · Mathematics 2015-09-17 Rostislav Grigorchuk , Konstantin Medynets

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

Group Theory · Mathematics 2025-01-15 Murray Elder , Jerry Shen , Armin Weiß

In this work, we explore the following question: If two words in a finitely generated free group have identical images as word maps on every finite group, must they be endomorphic to each other? In this regard, we introduce weak profinite…

Group Theory · Mathematics 2026-03-02 Shrinit Singh

We construct recursively-presented finitely-generated torsion groups which have bounded torsion and whose word problem is conjunctive equivalent (in particular positive and Turing equivalent) to a given recursively enumerable set. These…

Dynamical Systems · Mathematics 2022-03-03 Ville Salo

We describe inertial endomorphisms of an abelian group $A$, that is endomorphisms $\varphi$ with the property $|(\varphi(X)+X)/X|<\infty$ for each $X\le A$. They form a ring containing multiplications, the so-called finitary endomorphisms…

Group Theory · Mathematics 2013-10-18 Ulderico Dardano , Silvana Rinauro

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

Group Theory · Mathematics 2022-05-02 Laura Ciobanu , Albert Garreta

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…

Formal Languages and Automata Theory · Computer Science 2020-08-24 Daniele D'Angeli , Dominik Francoeur , Emanuele Rodaro , Jan Philipp Wächter

It is a well-known open problem since the 1970s whether a finitely generated perfect group can be normally generated by a single element or not. We prove that the topological version of this problem has an affirmative answer as long as we…

Group Theory · Mathematics 2013-07-12 Amichai Eisenmann , Nicolas Monod

We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.

Geometric Topology · Mathematics 2023-10-10 Alexei Lisitsa , Zipei Nie , Alexei Vernitski

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…

Group Theory · Mathematics 2020-04-28 Hang Lu Su

We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…

Logic · Mathematics 2013-11-11 Kyle Riggs

We prove that cyclic subgroup separability is preserved under exponential completion for groups that belong to a class that includes all coherent RAAGs and toral relatively hyperbolic groups; we do so by exploiting the structure of these…

Group Theory · Mathematics 2021-01-27 Jonathan Fruchter