English
Related papers

Related papers: Is decidability of the Submonoid Membership Proble…

200 papers

We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid $F$. It is also decidable whether or not a rational subset of $F$ is recognizable. We prove that a submonoid of $F$ is rational if and…

Group Theory · Mathematics 2022-11-14 Pedro V. Silva

The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this…

Logic in Computer Science · Computer Science 2023-06-22 Andrei Bulatov , Peter Mayr , Ágnes Szendrei

We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…

Group Theory · Mathematics 2016-10-20 Maurice Chiodo

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

Group Theory · Mathematics 2014-01-14 Moon Duchin , Hao Liang , Michael Shapiro

We demonstrate that the submonoid membership problem and the rational subset membership problem are equivalent in Artin groups. Both these problem are undecidable in a given Artin group if and only if the group embeds the right-angled Artin…

Group Theory · Mathematics 2024-09-27 Islam Foniqi

We consider two decision problems in infinite groups. The first problem is Subgroup Intersection: given two finitely generated subgroups $\langle \mathcal{G} \rangle, \langle \mathcal{H} \rangle$ of a group $G$, decide whether the…

Group Theory · Mathematics 2023-09-28 Ruiwen Dong

We consider deterministic algorithms for the well-known hidden subgroup problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) = f(g_2)$ iff…

Data Structures and Algorithms · Computer Science 2022-11-22 Zekun Ye , Lvzhou Li

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…

Discrete Mathematics · Computer Science 2016-04-11 Igor Potapov , Pavel Semukhin

A residually finite (profinite) group $G$ is just infinite if every non-trivial (closed) normal subgroup of $G$ is of finite index. This paper considers the problem of determining whether a (closed) subgroup $H$ of a just infinite group is…

Group Theory · Mathematics 2010-10-20 Colin Reid

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

Group Theory · Mathematics 2024-02-13 Doron Shafrir

If $G$ is a nilpotent group and $[G,G]$ has Hirsch length $1$, then every f.g. submonoid of $G$ is boundedly generated, i.e. a product of cyclic submonoids. Using a reduction of Bodart, this implies the decidability of the submonoid…

Group Theory · Mathematics 2024-05-10 Doron Shafrir

The aim of this short note is to provide a proof of the decidability of the generalized membership problem for relatively quasi-convex subgroups of finitely presented relatively hyperbolic groups, under some reasonably mild conditions on…

Group Theory · Mathematics 2020-05-27 Olga Kharlampovich , Pascal Weil

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

Group Theory · Mathematics 2018-04-25 Pedro Silva , Pascal Weil

We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…

Group Theory · Mathematics 2025-02-10 Jonathan Warne

Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…

Group Theory · Mathematics 2013-05-22 Andrew Duncan , Elizaveta Frenkel

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

Group Theory · Mathematics 2025-01-09 Oleg Bogopolski

The Tits alternative states that a finitely generated matrix group either contains a nonabelian free subgroup $F_2$, or it is virtually solvable. This paper considers two decision problems in virtually solvable matrix groups: the Identity…

Group Theory · Mathematics 2025-01-17 Corentin Bodart , Ruiwen Dong

In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…

Group Theory · Mathematics 2020-11-03 Igor Dolinka , Robert D. Gray