Related papers: Answering Five Open Problems Involving Semigroup C…
We compare three approaches to the notion of conjugacy for semigroups, the first one via the transitive closure of the $uv\sim vu$ relation, the second one via an action of inverse semigroups on themselves by partial transformations, and…
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been several attempts to extend the notion of conjugacy to semigroups. In this paper, we present a…
Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…
We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special…
Elements $a,b$ of a semigroup $S$ are said to be \emph{primarily conjugate} or just \emph{p-conjugate}, if there exist $x,y\in S^1$ such that $a=xy$ and $b=yx$. The p-conjugacy relation generalizes conjugacy in groups, but for general…
In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for…
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…
We consider semigroups of transformations (partial mappings defined on a set $A$) closed under the set-theoretic intersection of mappings treated as subsets of $A\times A$. On such semigroups we define two relations: the relation of…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
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…
Cross-connection theory provides the construction of a semigroup from its ideal structure using small categories. A concordant semigroup is an idempotent-connected abundant semigroup whose idempotents generate a regular subsemigroup. We…
A group $G$ is called subgroup conjugacy separable (abbreviated as SCS), if any two finitely generated and non-conjugate subgroups of $G$ remain non-conjugate in some finite quotient of $G$. We prove that free groups and the fundamental…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…
We collect some open problems about minimal presentations of numerical semigroups and, more generally, about defining ideals and free resolutions of their semigroup rings and associated graded rings. We emphasize both long-standing problems…
A group G is called subgroup conjugacy separable (abbreviated as SCS), if any two finitely generated and non-conjugate subgroups of G remain non-conjugate in some finite quotient of G. We prove that the free groups and the fundamental…
In a semigroup $S$ with fixed $c\in S$, one can construct a new semigroup $(S,\cdot_c)$ called a \emph{variant} by defining $x\cdot_c y:=xcy$. Elements $a,b\in S$ are \emph{primarily conjugate} if there exist $x,y\in S^1$ such that $a=xy,…