Related papers: Membership and Conjugacy in Inverse Semigroups
We show that the Membership Problem for finitely generated subgroups of 3-manifold groups is solvable.
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…
A complete classification of all finite bijective set-theoretic solutions $(S,s)$ to the Pentagon Equation is obtained. First, it is shown that every such solution determines a semigroup structure on the set $S$ that is the direct product…
Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and…
The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…
We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\mathbb{R}^{2}$, and a geometric object $t$, the goal is to…
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…
We consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap. We seek a collection $\mathcal{S}' \subseteq \mathcal{S}$ consisting of at least $k$ sets…
As part of his study of representations of the polycylic monoids, M.V. Lawson described all the closed inverse submonoids of a polycyclic monoid $P_n$ and classified them up to conjugacy. We show that Lawson's description can be extended to…
We present an algorithmic approach to the conjugacy problems in monoids and semigroups, using rewriting systems. There is a class of monoids and semigroups that satisfy the condition that the transposi- tion problem and the left and right…
In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…
We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…
We consider semigroup algorithmic problems in the wreath product $\mathbb{Z} \wr \mathbb{Z}$. Our paper focuses on two decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain the…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We prove that Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete. This implies the PSPACE-completeness of the spanning variant of Subgraph Reconfiguration under the token jumping rule for the property "a graph is an…
We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…
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…
Let $K$ be a commutative ring with unit and $S$ an inverse semigroup. We show that the semigroup algebra $KS$ can be described as a convolution algebra of functions on the universal \'etale groupoid associated to $S$ by Paterson. This…